%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.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 : n017.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:37 AM UTC 2026
% Result : Theorem 15.54s 4.66s
% Output : Refutation 16.12s
% 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/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
thf(26,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(27,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)],[26]) ).
thf(28,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C = empty_set )
| ( C @ ( C @ sk6 @ in ) ) )
& ( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ) ),
inference(cnf,[status(esa)],[27]) ).
thf(30,plain,
! [A: $i] :
( ( A = empty_set )
| ( A @ ( A @ sk6 @ in ) ) ),
inference(cnfConj,[status(thm)],[28]) ).
thf(33,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ in ) )
| ( A = empty_set ) ),
inference(lifteq,[status(thm)],[30]) ).
thf(34,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ in ) )
| ( A = empty_set ) ),
inference(simp,[status(thm)],[33]) ).
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/sandbox/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(14,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(15,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)],[14]) ).
thf(16,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)],[15]) ).
thf(19,plain,
! [A: $i] :
( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(29,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ),
inference(cnfConj,[status(thm)],[28]) ).
thf(31,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ in ) )
| ( A != empty_set ) ),
inference(lifteq,[status(thm)],[29]) ).
thf(32,plain,
! [A: $i] :
~ ( empty_set @ ( A @ in ) ),
inference(simp,[status(thm)],[31]) ).
thf(77,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)],[19,32]) ).
thf(78,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)],[77]) ).
thf(83,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ( sk5 != B )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(simp,[status(thm)],[78]) ).
thf(88,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(simp,[status(thm)],[83]) ).
thf(20,plain,
! [A: $i] :
( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(143,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)],[34,20]) ).
thf(144,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)],[143]) ).
thf(145,plain,
( ( sk4 @ ( sk3 @ disjoint ) )
| ( ( sk2 @ ( sk1 @ set_intersection2 ) )
= empty_set ) ),
inference(pattern_uni,[status(thm)],[144:[bind(A,$thf( sk2 @ ( sk1 @ set_intersection2 ) )),bind(B,$thf( sk2 @ ( sk1 @ set_intersection2 ) @ sk6 ))]]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ disjoint ) )
<=> ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
thf(35,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)],[6]) ).
thf(36,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)],[35]) ).
thf(37,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)],[36]) ).
thf(39,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(cnfConj,[status(thm)],[37]) ).
thf(41,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(lifteq,[status(thm)],[39]) ).
thf(42,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
!= empty_set ) ),
inference(simp,[status(thm)],[41]) ).
thf(555,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)],[145,42]) ).
thf(556,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) )
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(simp,[status(thm)],[555]) ).
thf(557,plain,
( ( sk2 @ ( sk1 @ disjoint ) )
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(pattern_uni,[status(thm)],[556:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(18,plain,
( ( sk4 @ ( sk3 @ disjoint ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(38,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
= empty_set )
| ~ ( B @ ( A @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[37]) ).
thf(40,plain,
! [B: $i,A: $i] :
( ~ ( B @ ( A @ disjoint ) )
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(lifteq,[status(thm)],[38]) ).
thf(17,plain,
( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(65,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( A @ in ) ) )
| ~ $true
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[17,32]) ).
thf(66,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) @ ( sk5 @ in ) )
!= ( empty_set @ ( A @ in ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[65]) ).
thf(70,plain,
! [A: $i] :
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ( sk5 != A )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[66]) ).
thf(73,plain,
( ( ( sk4 @ ( sk3 @ set_intersection2 ) )
!= empty_set )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[70]) ).
thf(472,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)],[40,73]) ).
thf(473,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ set_intersection2 ) )
!= ( sk4 @ ( sk3 @ set_intersection2 ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ ( B @ ( A @ disjoint ) ) ),
inference(simp,[status(thm)],[472]) ).
thf(474,plain,
( ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(pattern_uni,[status(thm)],[473:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 ))]]) ).
thf(526,plain,
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( sk4 @ ( sk3 @ disjoint ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) )
| ~ $true
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(paramod_ordered,[status(thm)],[18,474]) ).
thf(527,plain,
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( sk4 @ ( sk3 @ disjoint ) ) )
| ~ ( sk2 @ ( sk1 @ disjoint ) ) ),
inference(simp,[status(thm)],[526]) ).
thf(528,plain,
~ ( sk2 @ ( sk1 @ disjoint ) ),
inference(pattern_uni,[status(thm)],[527:[]]) ).
thf(609,plain,
( $false
| ( sk4 @ ( sk3 @ disjoint ) ) ),
inference(rewrite,[status(thm)],[557,528]) ).
thf(610,plain,
sk4 @ ( sk3 @ disjoint ),
inference(simp,[status(thm)],[609]) ).
thf(611,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( B @ ( A @ disjoint ) ) )
| ~ $true
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(paramod_ordered,[status(thm)],[610,40]) ).
thf(612,plain,
! [B: $i,A: $i] :
( ( ( sk4 @ ( sk3 @ disjoint ) )
!= ( B @ ( A @ disjoint ) ) )
| ( ( B @ ( A @ set_intersection2 ) )
= empty_set ) ),
inference(simp,[status(thm)],[611]) ).
thf(613,plain,
( ( sk4 @ ( sk3 @ set_intersection2 ) )
= empty_set ),
inference(pattern_uni,[status(thm)],[612:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 ))]]) ).
thf(1049,plain,
! [A: $i] :
( ( empty_set != empty_set )
| ~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ) ),
inference(rewrite,[status(thm)],[88,613]) ).
thf(1050,plain,
! [A: $i] :
~ ( sk2 @ ( sk1 @ set_intersection2 ) @ ( A @ in ) ),
inference(simp,[status(thm)],[1049]) ).
thf(1067,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ~ $true
| ( A = empty_set ) ),
inference(paramod_ordered,[status(thm)],[34,1050]) ).
thf(1068,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ in ) )
!= ( sk2 @ ( sk1 @ set_intersection2 ) @ ( B @ in ) ) )
| ( A = empty_set ) ),
inference(simp,[status(thm)],[1067]) ).
thf(1069,plain,
( ( sk2 @ ( sk1 @ set_intersection2 ) )
= empty_set ),
inference(pattern_uni,[status(thm)],[1068:[bind(A,$thf( sk2 @ ( sk1 @ set_intersection2 ) )),bind(B,$thf( sk2 @ ( sk1 @ set_intersection2 ) @ sk6 ))]]) ).
thf(1098,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)],[1069,42]) ).
thf(1099,plain,
! [B: $i,A: $i] :
( ( ( sk2 @ ( sk1 @ set_intersection2 ) )
!= ( B @ ( A @ set_intersection2 ) ) )
| ( B @ ( A @ disjoint ) ) ),
inference(simp,[status(thm)],[1098]) ).
thf(1100,plain,
sk2 @ ( sk1 @ disjoint ),
inference(pattern_uni,[status(thm)],[1099:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(1132,plain,
$false,
inference(rewrite,[status(thm)],[1100,528]) ).
thf(1133,plain,
$false,
inference(simp,[status(thm)],[1132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % 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.14/0.41 % Computer : n017.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sat Sep 26 08:32:48 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 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.84/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.05/1.04 % [INFO] Parsing done (165ms).
% 1.05/1.05 % [INFO] Running in sequential loop mode.
% 2.08/1.40 % [INFO] eprover registered as external prover.
% 2.08/1.41 % [INFO] Scanning for conjecture ...
% 2.08/1.49 % [INFO] Found a conjecture (or negated_conjecture) and 11 axioms. Running axiom selection ...
% 2.29/1.52 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 2.29/1.54 % [INFO] Problem is first-order (TPTP FOF).
% 2.29/1.54 % [INFO] Type checking passed.
% 2.29/1.55 % [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 ...
% 15.54/4.65 % [INFO] Killing All external provers ...
% 15.54/4.65 % Time passed: 4130ms (effective reasoning time: 3590ms)
% 15.54/4.65 % 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)>
% 15.54/4.66 % Axioms used in derivation (2): d1_xboole_0, d7_xboole_0
% 15.54/4.66 % No. of inferences in proof: 63
% 15.54/4.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4130 ms resp. 3590 ms w/o parsing
% 16.12/4.75 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.12/4.75 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------