%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU630^2 : TPTP v9.3.1. Released v3.7.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 : n007.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 : Wed Sep 30 08:28:50 AM UTC 2026
% Result : Theorem 87.16s 19.93s
% Output : Refutation 87.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 12 unt; 0 typ; 8 def)
% Number of atoms : 137 ( 25 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 877 ( 53 ~; 33 |; 26 &; 738 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 108 ( 14 ^; 68 !; 22 ?; 108 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(setadjoin_decl,type,
setadjoin: $i > $i > $i ).
thf(powerset_decl,type,
powerset: $i > $i ).
thf(dsetconstr_decl,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrI_decl,type,
dsetconstrI: $o ).
thf(binunion_decl,type,
binunion: $i > $i > $i ).
thf(kpair_decl,type,
kpair: $i > $i > $i ).
thf(cartprod_decl,type,
cartprod: $i > $i > $i ).
thf(ubforcartprodlem3_decl,type,
ubforcartprodlem3: $o ).
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(dsetconstrI_def,definition,
( dsetconstrI
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) ) ) ) ).
thf(kpair_def,definition,
( kpair
= ( ^ [A: $i,B: $i] : ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ).
thf(cartprod_def,definition,
( cartprod
= ( ^ [A: $i,B: $i] :
( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) )
@ ^ [C: $i] :
? [D: $i] :
( ( in @ D @ A )
& ? [E: $i] :
( ( in @ E @ B )
& ( C
= ( kpair @ D @ E ) ) ) ) ) ) ) ).
thf(ubforcartprodlem3_def,definition,
( ubforcartprodlem3
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( kpair @ C @ D ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) ) ) ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) )
@ ^ [E: $i] :
? [F: $i] :
( ( in @ F @ A )
& ? [G: $i] :
( ( in @ G @ B )
& ( E
= ( setadjoin @ ( setadjoin @ F @ emptyset ) @ ( setadjoin @ ( setadjoin @ F @ ( setadjoin @ G @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ! [B: $i] :
( ( in @ B @ sk1 )
=> ! [C: $i] :
( ( in @ C @ A )
=> ( in @ ( setadjoin @ ( setadjoin @ B @ emptyset ) @ ( setadjoin @ ( setadjoin @ B @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ A ) ) )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ A )
& ( D
= ( setadjoin @ ( setadjoin @ E @ emptyset ) @ ( setadjoin @ ( setadjoin @ E @ ( setadjoin @ F @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i] :
~ ( ( in @ A @ sk1 )
=> ! [B: $i] :
( ( in @ B @ sk2 )
=> ( in @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [C: $i] :
? [D: $i] :
( ( in @ D @ sk1 )
& ? [E: $i] :
( ( in @ E @ sk2 )
& ( C
= ( setadjoin @ ( setadjoin @ D @ emptyset ) @ ( setadjoin @ ( setadjoin @ D @ ( setadjoin @ E @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: $i] :
~ ( ( in @ A @ sk2 )
=> ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ A @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [B: $i] :
? [C: $i] :
( ( in @ C @ sk1 )
& ? [D: $i] :
( ( in @ D @ sk2 )
& ( B
= ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ) ) ).
thf(1,conjecture,
( dsetconstrI
=> ( ubforcartprodlem3
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( kpair @ C @ D ) @ ( cartprod @ A @ B ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartprodpairin) ).
thf(2,negated_conjecture,
~ ( dsetconstrI
=> ( ubforcartprodlem3
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( kpair @ C @ D ) @ ( cartprod @ A @ B ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) ) ) )
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) )
@ ^ [E: $i] :
? [F: $i] :
( ( in @ F @ A )
& ? [G: $i] :
( ( in @ G @ B )
& ( E
= ( setadjoin @ ( setadjoin @ F @ emptyset ) @ ( setadjoin @ ( setadjoin @ F @ ( setadjoin @ G @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i > $o,A: $i] :
( ( ~ ( in @ C @ A )
| ~ ( B @ C )
| ( in @ C @ ( dsetconstr @ A @ B ) ) )
& ( ~ ( in @ F @ D )
| ~ ( in @ G @ E )
| ( in @ ( setadjoin @ ( setadjoin @ F @ emptyset ) @ ( setadjoin @ ( setadjoin @ F @ ( setadjoin @ G @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ D @ E ) ) ) ) )
& ( in @ sk3 @ sk1 )
& ( in @ sk4 @ sk2 )
& ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [H: $i] :
? [I: $i] :
( ( in @ I @ sk1 )
& ? [J: $i] :
( ( in @ J @ sk2 )
& ( H
= ( setadjoin @ ( setadjoin @ I @ emptyset ) @ ( setadjoin @ ( setadjoin @ I @ ( setadjoin @ J @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ B )
| ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(10,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ B )
| ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) ) ),
inference(simp,[status(thm)],[9]) ).
thf(5,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( B @ C )
| ( in @ C @ ( dsetconstr @ A @ B ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [A: $i] :
? [B: $i] :
( ( in @ B @ sk1 )
& ? [C: $i] :
( ( in @ C @ sk2 )
& ( A
= ( setadjoin @ ( setadjoin @ B @ emptyset ) @ ( setadjoin @ ( setadjoin @ B @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(22,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( B @ C )
| ~ $true
| ( ( in @ C @ ( dsetconstr @ A @ B ) )
!= ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ sk2 )
& ( D
= ( setadjoin @ ( setadjoin @ E @ emptyset ) @ ( setadjoin @ ( setadjoin @ E @ ( setadjoin @ F @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[5,6]) ).
thf(23,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( B @ C )
| ( ( in @ C @ ( dsetconstr @ A @ B ) )
!= ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
@ ( dsetconstr @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ sk2 )
& ( D
= ( setadjoin @ ( setadjoin @ E @ emptyset ) @ ( setadjoin @ ( setadjoin @ E @ ( setadjoin @ F @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
( ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) )
| ~ ? [A: $i] :
( ( in @ A @ sk1 )
& ? [B: $i] :
( ( in @ B @ sk2 )
& ( ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) )),bind(B,$thf( ^ [D: $i] : ? [E: $i] : ( ( in @ E @ sk1 ) & ? [F: $i] : ( ( in @ F @ sk2 ) & ( D = ( setadjoin @ ( setadjoin @ E @ emptyset ) @ ( setadjoin @ ( setadjoin @ E @ ( setadjoin @ F @ emptyset ) ) @ emptyset ) ) ) ) ) )),bind(C,$thf( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ))]]) ).
thf(67,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) )
| ~ ( in @ A @ sk1 )
| ~ ( in @ B @ sk2 )
| ( ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(68,plain,
! [B: $i,A: $i] :
( ( ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) )
| ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) )
| ~ ( in @ A @ sk1 )
| ~ ( in @ B @ sk2 ) ),
inference(lifteq,[status(thm)],[67]) ).
thf(15546,plain,
( ~ ( in @ sk4 @ sk2 )
| ~ ( in @ sk3 @ sk1 )
| ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) ) ),
inference(pattern_uni,[status(thm)],[68:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 ))]]) ).
thf(7,plain,
in @ sk3 @ sk1,
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
in @ sk4 @ sk2,
inference(cnfConj,[status(thm)],[4]) ).
thf(17680,plain,
( ~ $true
| ~ $true
| ~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) ) ),
inference(rewrite,[status(thm)],[15546,7,8]) ).
thf(17681,plain,
~ ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[17680]) ).
thf(17700,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ B )
| ~ $true
| ( ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) )
!= ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,17681]) ).
thf(17701,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ B )
| ( ( in @ ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ A @ B ) ) ) )
!= ( in @ ( setadjoin @ ( setadjoin @ sk3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sk3 @ ( setadjoin @ sk4 @ emptyset ) ) @ emptyset ) ) @ ( powerset @ ( powerset @ ( binunion @ sk1 @ sk2 ) ) ) ) ) ),
inference(simp,[status(thm)],[17700]) ).
thf(17702,plain,
( ~ ( in @ sk3 @ sk1 )
| ~ ( in @ sk4 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[17701:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind(D,$thf( sk4 ))]]) ).
thf(17983,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[17702,7,8]) ).
thf(17984,plain,
$false,
inference(simp,[status(thm)],[17983]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU630^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % 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.09/0.21 % Computer : n007.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 13:58:22 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 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.03/0.89 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.50/1.11 % [INFO] Parsing done (220ms).
% 1.50/1.13 % [INFO] Running in sequential loop mode.
% 2.33/1.55 % [INFO] eprover registered as external prover.
% 2.33/1.55 % [INFO] Scanning for conjecture ...
% 2.55/1.68 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.73/1.72 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.73/1.72 % [INFO] Problem is higher-order (TPTP THF).
% 2.73/1.72 % [INFO] Type checking passed.
% 2.73/1.73 % [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 ...
% 87.16/19.92 % [INFO] Killing All external provers ...
% 87.16/19.93 % Time passed: 19567ms (effective reasoning time: 18790ms)
% 87.16/19.93 % 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)>
% 87.16/19.93 % Axioms used in derivation (0):
% 87.16/19.93 % No. of inferences in proof: 23
% 87.16/19.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 19567 ms resp. 18790 ms w/o parsing
% 87.16/19.99 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 87.16/19.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------