TSTP Solution File: SET975+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SET975+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 19 11:54:58 EDT 2023
% Result : Theorem 3.82s 2.47s
% Output : Refutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 49 ( 16 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 156 ( 8 ~; 0 |; 12 &; 119 @)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 47 ( 0 ^; 43 !; 4 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(ordered_pair_type,type,
ordered_pair: $i > $i > $i ).
thf(cartesian_product2_type,type,
cartesian_product2: $i > $i > $i ).
thf(singleton_type,type,
singleton: $i > $i ).
thf(unordered_pair_type,type,
unordered_pair: $i > $i > $i ).
thf(empty_type,type,
empty: $i > $o ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( B
= ( singleton @ A ) )
<=> ! [C: $i] :
( ( in @ C @ B )
<=> ( C = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
thf(25,plain,
! [A: $i,B: $i] :
( ( ( B
= ( singleton @ A ) )
=> ! [C: $i] :
( ( ( in @ C @ B )
=> ( C = A ) )
& ( ( C = A )
=> ( in @ C @ B ) ) ) )
& ( ! [C: $i] :
( ( ( in @ C @ B )
=> ( C = A ) )
& ( ( C = A )
=> ( in @ C @ B ) ) )
=> ( B
= ( singleton @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( ordered_pair @ A @ B )
= ( unordered_pair @ ( unordered_pair @ A @ B ) @ ( singleton @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
thf(45,plain,
! [A: $i,B: $i] :
( ( ordered_pair @ A @ B )
= ( unordered_pair @ ( unordered_pair @ A @ B ) @ ( singleton @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(7,axiom,
! [A: $i,B: $i] :
~ ( empty @ ( ordered_pair @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_zfmisc_1) ).
thf(48,plain,
! [A: $i,B: $i] :
~ ( empty @ ( ordered_pair @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i] :
( ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ ( singleton @ C ) @ D ) )
<=> ( ( A = C )
& ( in @ B @ D ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t128_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ ( singleton @ C ) @ D ) )
<=> ( ( A = C )
& ( in @ B @ D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(11,plain,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ ( singleton @ C ) @ D ) )
=> ( ( A = C )
& ( in @ B @ D ) ) )
& ( ( ( A = C )
& ( in @ B @ D ) )
=> ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ ( singleton @ C ) @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ C @ D ) )
<=> ( ( in @ A @ C )
& ( in @ B @ D ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
thf(51,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ C @ D ) )
=> ( ( in @ A @ C )
& ( in @ B @ D ) ) )
& ( ( ( in @ A @ C )
& ( in @ B @ D ) )
=> ( in @ ( ordered_pair @ A @ B ) @ ( cartesian_product2 @ C @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(20,plain,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(57,plain,
? [A: $i] : ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(22,plain,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(10,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(59,plain,
? [A: $i] :
~ ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(64,plain,
$false,
inference(e,[status(thm)],[25,45,48,11,51,20,57,22,59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET975+1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 18 19:21:06 EDT 2023
% 0.12/0.33 % CPUTime :
% 1.00/0.96 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.34/1.16 % [INFO] Parsing done (196ms).
% 1.34/1.17 % [INFO] Running in sequential loop mode.
% 1.84/1.51 % [INFO] eprover registered as external prover.
% 1.84/1.51 % [INFO] cvc4 registered as external prover.
% 1.84/1.52 % [INFO] Scanning for conjecture ...
% 1.93/1.60 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 2.08/1.65 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 2.08/1.67 % [INFO] Problem is first-order (TPTP FOF).
% 2.08/1.68 % [INFO] Type checking passed.
% 2.08/1.68 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.63/2.47 % External prover 'e' found a proof!
% 3.82/2.47 % [INFO] Killing All external provers ...
% 3.82/2.47 % Time passed: 1992ms (effective reasoning time: 1292ms)
% 3.82/2.47 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 3.82/2.47 % Axioms used in derivation (8): d5_tarski, commutativity_k2_tarski, l55_zfmisc_1, rc1_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, fc1_zfmisc_1, d1_tarski
% 3.82/2.47 % No. of inferences in proof: 20
% 3.82/2.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1992 ms resp. 1292 ms w/o parsing
% 3.94/2.53 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.94/2.53 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------