%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU120+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n010.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:37:38 AM UTC 2026
% Result : Theorem 28.28s 8.31s
% Output : Refutation 28.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 15 unt; 0 typ; 6 def)
% Number of atoms : 201 ( 67 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 600 ( 104 ~; 67 |; 25 &; 394 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 112 ( 1 ^; 88 !; 17 ?; 112 :)
% ( 0 !>; 0 ?*; 0 @-; 6 @+)
% Comments :
%------------------------------------------------------------------------------
thf(disjoint_decl,type,
disjoint: $i > $i > $o ).
thf(in_decl,type,
in: $i > $i > $o ).
thf(set_intersection2_decl,type,
set_intersection2: $i > $i > $i ).
thf(empty_set_decl,type,
empty_set: $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(sk4_decl,type,
sk4: $i ).
thf(sk5_decl,type,
sk5: $i ).
thf(sk6_decl,type,
sk6: $i > $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
? [B: $i] :
( ~ ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
& ~ ( B @ ( A @ disjoint ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
( ~ ? [B: $i] : ( A @ ( sk1 @ set_intersection2 ) @ ( B @ in ) )
& ~ ( A @ ( sk1 @ disjoint ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i] :
? [B: $i] :
( ( B @ ( A @ disjoint ) )
& ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: $i] :
( ( A @ ( sk3 @ disjoint ) )
& ? [B: $i] : ( A @ ( sk3 @ set_intersection2 ) @ ( B @ in ) ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( @+[A: $i] : ( sk4 @ ( sk3 @ set_intersection2 ) @ ( A @ in ) ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( ^ [A: $i] :
@+[B: $i] : ( A @ ( B @ in ) ) ) ) ).
thf(5,axiom,
! [A: $i] :
( ( A = empty_set )
<=> ! [B: $i] :
~ ( A @ ( B @ in ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
thf(28,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(29,plain,
( ! [A: $i] :
( ~ ? [B: $i] : ( A @ ( B @ in ) )
=> ( A = empty_set ) )
& ! [A: $i] :
( ( A = empty_set )
=> ~ ? [B: $i] : ( A @ ( B @ in ) ) ) ),
inference(miniscope,[status(thm)],[28]) ).
thf(30,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C = empty_set )
| ( C @ ( C @ sk6 @ in ) ) )
& ( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ) ),
inference(cnf,[status(esa)],[29]) ).
thf(32,plain,
! [A: $i] :
( ( A = empty_set )
| ( A @ ( A @ sk6 @ in ) ) ),
inference(cnfConj,[status(thm)],[30]) ).
thf(35,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ in ) )
| ( A = empty_set ) ),
inference(lifteq,[status(thm)],[32]) ).
thf(36,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ in ) )
| ( A = empty_set ) ),
inference(simp,[status(thm)],[35]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ~ ( ( B @ ( A @ disjoint ) )
& ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
& ~ ( ! [C: $i] :
~ ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
& ~ ( B @ ( A @ disjoint ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ~ ( ( B @ ( A @ disjoint ) )
& ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
& ~ ( ! [C: $i] :
~ ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
& ~ ( B @ ( A @ disjoint ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(16,plain,
~ ! [A: $i,B: $i] :
( ~ ( ( B @ ( A @ disjoint ) )
& ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
& ~ ( ! [C: $i] :
~ ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
& ~ ( B @ ( A @ disjoint ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(17,plain,
~ ( ~ ? [A: $i,B: $i] :
( ( B @ ( A @ disjoint ) )
& ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
& ~ ? [A: $i,B: $i] :
( ~ ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
& ~ ( B @ ( A @ disjoint ) ) ) ),
inference(miniscope,[status(thm)],[16]) ).
thf(18,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) )
& ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) )
& ( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) )
& ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ) ),
inference(cnf,[status(esa)],[17]) ).
thf(21,plain,
! [A: $i] :
( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(cnfConj,[status(thm)],[18]) ).
thf(31,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ),
inference(cnfConj,[status(thm)],[30]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ),
inference(lifteq,[status(thm)],[31]) ).
thf(34,plain,
! [A: $i] :
~ ( empty_set @ ( A @ in ) ),
inference(simp,[status(thm)],[33]) ).
thf(113,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( B @ in ) ) )
| ~ $true
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(paramod_ordered,[status(thm)],[21,34]) ).
thf(114,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( B @ in ) ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(simp,[status(thm)],[113]) ).
thf(123,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ( sk5 != B )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(simp,[status(thm)],[114]) ).
thf(128,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(simp,[status(thm)],[123]) ).
thf(22,plain,
! [A: $i] :
( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(cnfConj,[status(thm)],[18]) ).
thf(233,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ( sk4 @ ( sk3 @ disjoint ) )
| ~ $true
| ( A = empty_set ) ),
inference(paramod_ordered,[status(thm)],[36,22]) ).
thf(234,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ( sk4 @ ( sk3 @ disjoint ) )
| ( A = empty_set ) ),
inference(simp,[status(thm)],[233]) ).
thf(235,plain,
( ( sk4 @ ( sk3 @ disjoint ) )
| ( ( sk2 @ ( sk1 @ set_intersection2 ) )
= empty_set ) ),
inference(pattern_uni,[status(thm)],[234:[bind(A,$thf( sk2 @ ( sk1 @ set_intersection2 ) )),bind(B,$thf( sk2 @ ( sk1 @ set_intersection2 ) @ sk6 ))]]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ disjoint ) )
<=> ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
thf(64,plain,
! [A: $i,B: $i] :
( ( ( ( B @ ( A @ set_intersection2 ) )
= empty_set )
=> ( B @ ( A @ disjoint ) ) )
& ( ( B @ ( A @ disjoint ) )
=> ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(65,plain,
( ! [A: $i,B: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
= empty_set )
=> ( B @ ( A @ disjoint ) ) )
& ! [A: $i,B: $i] :
( ( B @ ( A @ disjoint ) )
=> ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ) ),
inference(miniscope,[status(thm)],[64]) ).
thf(66,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ disjoint ) )
| ( ( D @ ( C @ set_intersection2 ) )
!= empty_set ) )
& ( ( ( B @ ( A @ set_intersection2 ) )
= empty_set )
| ~ ( B @ ( A @ disjoint ) ) ) ),
inference(cnf,[status(esa)],[65]) ).
thf(68,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(cnfConj,[status(thm)],[66]) ).
thf(70,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(lifteq,[status(thm)],[68]) ).
thf(71,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(simp,[status(thm)],[70]) ).
thf(4927,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) )
| ( empty_set != empty_set )
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[235,71]) ).
thf(4928,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) )
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(simp,[status(thm)],[4927]) ).
thf(4929,plain,
( ( sk2 @ ( sk1 @ disjoint ) )
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(pattern_uni,[status(thm)],[4928:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(20,plain,
( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[18]) ).
thf(67,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
= empty_set )
| ~ ( B @ ( A @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[66]) ).
thf(69,plain,
! [B: $i,A: $i] :
( ~ ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(lifteq,[status(thm)],[67]) ).
thf(19,plain,
( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[18]) ).
thf(103,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( A @ in ) ) )
| ~ $true
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[19,34]) ).
thf(104,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( A @ in ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[103]) ).
thf(107,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ( sk5 != A )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[104]) ).
thf(109,plain,
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[107]) ).
thf(4618,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
!= ( sk4 @ ( sk3 @ set_intersection2 ) ) )
| ( empty_set != empty_set )
| ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ ( B @ ( A @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[69,109]) ).
thf(4619,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
!= ( sk4 @ ( sk3 @ set_intersection2 ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ ( B @ ( A @ disjoint ) ) ),
inference(simp,[status(thm)],[4618]) ).
thf(4620,plain,
( ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(pattern_uni,[status(thm)],[4619:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 ))]]) ).
thf(4733,plain,
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( sk4 @ ( sk3 @ disjoint ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ $true
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[20,4620]) ).
thf(4734,plain,
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( sk4 @ ( sk3 @ disjoint ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[4733]) ).
thf(4735,plain,
~ ( sk2 @ ( sk1 @ disjoint ) ),
inference(pattern_uni,[status(thm)],[4734:[]]) ).
thf(6087,plain,
( $false
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(rewrite,[status(thm)],[4929,4735]) ).
thf(6088,plain,
sk4 @ ( sk3 @ disjoint ),
inference(simp,[status(thm)],[6087]) ).
thf(6093,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( B @ ( A @ disjoint ) ) )
| ~ $true
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(paramod_ordered,[status(thm)],[6088,69]) ).
thf(6094,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( B @ ( A @ disjoint ) ) )
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(simp,[status(thm)],[6093]) ).
thf(6095,plain,
( ( sk4 @ ( sk3 @ set_intersection2 ) )
= empty_set ),
inference(pattern_uni,[status(thm)],[6094:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 ))]]) ).
thf(7845,plain,
! [A: $i] :
( ( empty_set != empty_set )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(rewrite,[status(thm)],[128,6095]) ).
thf(7846,plain,
! [A: $i] :
~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ),
inference(simp,[status(thm)],[7845]) ).
thf(7923,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ~ $true
| ( A = empty_set ) ),
inference(paramod_ordered,[status(thm)],[36,7846]) ).
thf(7924,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ( A = empty_set ) ),
inference(simp,[status(thm)],[7923]) ).
thf(7925,plain,
( ( sk2 @ ( sk1 @ set_intersection2 ) )
= empty_set ),
inference(pattern_uni,[status(thm)],[7924:[bind(A,$thf( sk2 @ ( sk1 @ set_intersection2 ) )),bind(B,$thf( sk2 @ ( sk1 @ set_intersection2 ) @ sk6 ))]]) ).
thf(8030,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) )
| ( empty_set != empty_set ) ),
inference(paramod_ordered,[status(thm)],[7925,71]) ).
thf(8031,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) ) ),
inference(simp,[status(thm)],[8030]) ).
thf(8032,plain,
sk2 @ ( sk1 @ disjoint ),
inference(pattern_uni,[status(thm)],[8031:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(8093,plain,
$false,
inference(rewrite,[status(thm)],[8032,4735]) ).
thf(8094,plain,
$false,
inference(simp,[status(thm)],[8093]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU120+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.13/0.40 % Computer : n010.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sat Sep 26 08:37:30 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.29/1.21 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.63/1.49 % [INFO] Parsing done (272ms).
% 1.83/1.51 % [INFO] Running in sequential loop mode.
% 2.68/2.07 % [INFO] eprover registered as external prover.
% 2.68/2.08 % [INFO] Scanning for conjecture ...
% 2.88/2.18 % [INFO] Found a conjecture (or negated_conjecture) and 13 axioms. Running axiom selection ...
% 2.94/2.21 % [INFO] Axiom selection finished. Selected 13 axioms (removed 0 axioms).
% 2.94/2.24 % [INFO] Problem is first-order (TPTP FOF).
% 2.94/2.24 % [INFO] Type checking passed.
% 2.94/2.25 % [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 ...
% 28.28/8.31 % [INFO] Killing All external provers ...
% 28.28/8.31 % Time passed: 7736ms (effective reasoning time: 6786ms)
% 28.28/8.31 % 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)>
% 28.28/8.31 % Axioms used in derivation (2): d1_xboole_0, d7_xboole_0
% 28.28/8.31 % No. of inferences in proof: 63
% 28.28/8.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 7736 ms resp. 6786 ms w/o parsing
% 28.28/8.37 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 28.28/8.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------