%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET980+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:31:28 AM UTC 2026
% Result : Theorem 3.21s 1.82s
% Output : Refutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 33 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 157 ( 11 ~; 9 |; 10 &; 108 @)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 0 ^; 51 !; 4 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(cartesian_product2_decl,type,
cartesian_product2: $i > $i > $i ).
thf(empty_set_decl,type,
empty_set: $i ).
thf(in_decl,type,
in: $i > $i > $o ).
thf(unordered_pair_decl,type,
unordered_pair: $i > $i > $i ).
thf(ordered_pair_decl,type,
ordered_pair: $i > $i > $i ).
thf(singleton_decl,type,
singleton: $i > $i ).
thf(empty_decl,type,
empty: $i > $o ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ ordered_pair ) )
= ( A @ singleton @ ( B @ ( A @ unordered_pair ) @ unordered_pair ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
thf(38,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ ordered_pair ) )
= ( A @ singleton @ ( B @ ( A @ unordered_pair ) @ unordered_pair ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(7,axiom,
empty_set @ empty,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(41,plain,
empty_set @ empty,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(9,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ cartesian_product2 ) @ ( B @ ( A @ ordered_pair ) @ in ) )
<=> ( ( D @ ( B @ in ) )
& ( C @ ( A @ in ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
thf(45,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( ( D @ ( B @ in ) )
& ( C @ ( A @ in ) ) )
=> ( D @ ( C @ cartesian_product2 ) @ ( B @ ( A @ ordered_pair ) @ in ) ) )
& ( ( D @ ( C @ cartesian_product2 ) @ ( B @ ( A @ ordered_pair ) @ in ) )
=> ( ( D @ ( B @ in ) )
& ( C @ ( A @ in ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(11,axiom,
? [A: $i] :
~ ( A @ empty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(54,plain,
? [A: $i] :
~ ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(26,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(13,axiom,
! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ in ) )
<=> ( B @ ( C @ in ) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
thf(68,plain,
! [A: $i,B: $i] :
( ! [C: $i] :
( ( ( B @ ( C @ in ) )
=> ( A @ ( C @ in ) ) )
& ( ( A @ ( C @ in ) )
=> ( B @ ( C @ in ) ) ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(8,axiom,
! [A: $i,B: $i] :
~ ( B @ ( A @ ordered_pair ) @ empty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_zfmisc_1) ).
thf(42,plain,
! [A: $i,B: $i] :
~ ( B @ ( A @ ordered_pair ) @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(24,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(10,axiom,
? [A: $i] : ( A @ empty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(52,plain,
? [A: $i] : ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( B @ ( A @ cartesian_product2 ) )
= ( D @ ( C @ cartesian_product2 ) ) )
=> ( ( ( B = D )
& ( A = C ) )
| ( B = empty_set )
| ( A = empty_set ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t134_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( B @ ( A @ cartesian_product2 ) )
= ( D @ ( C @ cartesian_product2 ) ) )
=> ( ( ( B = D )
& ( A = C ) )
| ( B = empty_set )
| ( A = empty_set ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(14,plain,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( B @ ( A @ cartesian_product2 ) )
= ( D @ ( C @ cartesian_product2 ) ) )
=> ( ( ( B = D )
& ( A = C ) )
| ( B = empty_set )
| ( A = empty_set ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,axiom,
! [A: $i,B: $i] :
( ( ( B @ ( A @ cartesian_product2 ) )
= empty_set )
<=> ( ( B = empty_set )
| ( A = empty_set ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t113_zfmisc_1) ).
thf(57,plain,
! [A: $i,B: $i] :
( ( ( ( B = empty_set )
| ( A = empty_set ) )
=> ( ( B @ ( A @ cartesian_product2 ) )
= empty_set ) )
& ( ( ( B @ ( A @ cartesian_product2 ) )
= empty_set )
=> ( ( B = empty_set )
| ( A = empty_set ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(5,axiom,
! [A: $i] :
( ( A = empty_set )
<=> ! [B: $i] :
~ ( A @ ( B @ in ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
thf(29,plain,
! [A: $i] :
( ( ! [B: $i] :
~ ( A @ ( B @ in ) )
=> ( A = empty_set ) )
& ( ( A = empty_set )
=> ! [B: $i] :
~ ( A @ ( B @ in ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(79,plain,
$false,
inference(e,[status(thm)],[38,41,45,54,26,68,42,24,52,14,57,29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET980+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.38 % Computer : n004.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sat Sep 26 08:28:52 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.69/0.71 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.92/0.81 % [INFO] Parsing done (102ms).
% 0.92/0.82 % [INFO] Running in sequential loop mode.
% 1.16/1.03 % [INFO] eprover registered as external prover.
% 1.46/1.03 % [INFO] Scanning for conjecture ...
% 1.46/1.08 % [INFO] Found a conjecture (or negated_conjecture) and 11 axioms. Running axiom selection ...
% 1.46/1.10 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 1.46/1.12 % [INFO] Problem is first-order (TPTP FOF).
% 1.69/1.13 % [INFO] Type checking passed.
% 1.69/1.14 % [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.21/1.81 % External prover 'e' found a proof!
% 3.21/1.81 % [INFO] Killing All external provers ...
% 3.21/1.82 % Time passed: 1329ms (effective reasoning time: 990ms)
% 3.21/1.82 % 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.21/1.82 % Axioms used in derivation (11): fc1_zfmisc_1, d1_xboole_0, t2_tarski, commutativity_k2_tarski, l55_zfmisc_1, rc1_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, fc1_xboole_0, t113_zfmisc_1, d5_tarski
% 3.21/1.82 % No. of inferences in proof: 26
% 3.21/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1329 ms resp. 990 ms w/o parsing
% 3.21/1.87 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.21/1.87 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------