TSTP Solution File: SEV229^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV229^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n027.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 : Mon Jun 24 15:59:48 EDT 2024
% Result : Theorem 13.04s 3.16s
% Output : Refutation 13.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 1
% Syntax : Number of formulae : 92 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 341 ( 31 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 632 ( 124 ~; 164 |; 14 &; 309 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 8 ^ 51 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cE_type,type,
cE: a > $o ).
thf(cD_type,type,
cD: a > $o ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: a ).
thf(1,conjecture,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5209_pme) ).
thf(2,negated_conjecture,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) ) )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(6,plain,
( ~ ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ~ ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(13,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(15,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(7,plain,
( ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(16,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(20,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(simp,[status(thm)],[16]) ).
thf(605,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cE @ B )
| ( cE @ A )
| ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[20]) ).
thf(606,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cE @ A )
| ( cE @ A ) ),
inference(pattern_uni,[status(thm)],[605:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(617,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(simp,[status(thm)],[606]) ).
thf(640,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[15,617]) ).
thf(641,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[640:[bind(A,$thf( sk4 ))]]) ).
thf(19,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(387,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ( cD @ A )
| ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[19]) ).
thf(388,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cD @ A )
| ( cD @ A ) ),
inference(pattern_uni,[status(thm)],[387:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(390,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(simp,[status(thm)],[388]) ).
thf(989,plain,
! [A: a] :
( ( sk1 @ sk2 )
| ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[641,390]) ).
thf(990,plain,
( ( sk1 @ sk2 )
| ( cE @ sk4 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[989:[bind(A,$thf( sk3 ))]]) ).
thf(1662,plain,
! [A: a] :
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[990,617]) ).
thf(1663,plain,
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1662:[bind(A,$thf( sk2 ))]]) ).
thf(12,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(656,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[12,617]) ).
thf(657,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[656:[bind(A,$thf( sk4 ))]]) ).
thf(1241,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[657,617]) ).
thf(1242,plain,
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1241:[bind(A,$thf( sk2 ))]]) ).
thf(2238,plain,
( ( cE @ sk4 )
| ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[1663,1242]) ).
thf(2239,plain,
( ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2238:[]]) ).
thf(10,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(406,plain,
! [A: a] :
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[10,390]) ).
thf(407,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[406:[bind(A,$thf( sk3 ))]]) ).
thf(646,plain,
! [A: a] :
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[407,617]) ).
thf(647,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[646:[bind(A,$thf( sk2 ))]]) ).
thf(11,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(638,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cE @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[11,617]) ).
thf(639,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[638:[bind(A,$thf( sk2 ))]]) ).
thf(1195,plain,
( ~ ( cE @ sk4 )
| ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[647,639]) ).
thf(1196,plain,
( ~ ( cE @ sk4 )
| ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1195:[]]) ).
thf(2273,plain,
( ( cE @ sk2 )
| ( ( cE @ sk4 )
!= ( cE @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[2239,1196]) ).
thf(2274,plain,
cE @ sk2,
inference(pattern_uni,[status(thm)],[2273:[]]) ).
thf(2320,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[13,2274]) ).
thf(2321,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 ) ),
inference(simp,[status(thm)],[2320]) ).
thf(1664,plain,
! [A: a] :
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[990,390]) ).
thf(1665,plain,
( ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1664:[bind(A,$thf( sk2 ))]]) ).
thf(1243,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[657,390]) ).
thf(1244,plain,
( ~ ( cD @ sk3 )
| ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[1243:[bind(A,$thf( sk2 ))]]) ).
thf(2401,plain,
( ( cE @ sk4 )
| ( cD @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[1665,1244]) ).
thf(2402,plain,
( ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2401:[]]) ).
thf(445,plain,
! [A: a] :
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[407,390]) ).
thf(446,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[445:[bind(A,$thf( sk2 ))]]) ).
thf(422,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[11,390]) ).
thf(423,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[422:[bind(A,$thf( sk2 ))]]) ).
thf(793,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[446,423]) ).
thf(794,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[793:[]]) ).
thf(14,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(831,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[794,14]) ).
thf(832,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[831:[]]) ).
thf(2314,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[832,2274]) ).
thf(2315,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk3 ) ),
inference(simp,[status(thm)],[2314]) ).
thf(2355,plain,
! [A: a] :
( ~ ( cE @ sk4 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2315,390]) ).
thf(2356,plain,
( ~ ( cE @ sk4 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[2355:[bind(A,$thf( sk3 ))]]) ).
thf(8,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(841,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[794,8]) ).
thf(842,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[841:[]]) ).
thf(2316,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[842,2274]) ).
thf(2317,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk3 ) ),
inference(simp,[status(thm)],[2316]) ).
thf(2411,plain,
( ~ ( cE @ sk4 )
| ( ( cD @ sk3 )
!= ( cD @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[2356,2317]) ).
thf(2412,plain,
~ ( cE @ sk4 ),
inference(pattern_uni,[status(thm)],[2411:[]]) ).
thf(2444,plain,
( $false
| ( cD @ sk2 ) ),
inference(rewrite,[status(thm)],[2402,2412]) ).
thf(2445,plain,
cD @ sk2,
inference(simp,[status(thm)],[2444]) ).
thf(2645,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ $true ),
inference(rewrite,[status(thm)],[2321,2445]) ).
thf(2646,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[2645]) ).
thf(2647,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2646,617]) ).
thf(2648,plain,
( ( sk1 @ sk3 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[2647:[bind(A,$thf( sk4 ))]]) ).
thf(2654,plain,
( ( sk1 @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[2648,2412]) ).
thf(2655,plain,
sk1 @ sk3,
inference(simp,[status(thm)],[2654]) ).
thf(2658,plain,
! [A: a] :
( ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2655,390]) ).
thf(2659,plain,
cD @ sk3,
inference(pattern_uni,[status(thm)],[2658:[bind(A,$thf( sk3 ))]]) ).
thf(9,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(2318,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[9,2274]) ).
thf(2319,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 ) ),
inference(simp,[status(thm)],[2318]) ).
thf(2621,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ $true ),
inference(rewrite,[status(thm)],[2319,2445]) ).
thf(2622,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[2621]) ).
thf(2624,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2622,617]) ).
thf(2625,plain,
( ~ ( cD @ sk3 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[2624:[bind(A,$thf( sk4 ))]]) ).
thf(2630,plain,
( ~ ( cD @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[2625,2412]) ).
thf(2631,plain,
~ ( cD @ sk3 ),
inference(simp,[status(thm)],[2630]) ).
thf(2662,plain,
$false,
inference(rewrite,[status(thm)],[2659,2631]) ).
thf(2663,plain,
$false,
inference(simp,[status(thm)],[2662]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV229^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_Leo-III %s %d SAT
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 19:12:55 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.96/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.96 % [INFO] Parsing done (95ms).
% 1.21/0.97 % [INFO] Running in sequential loop mode.
% 1.43/1.16 % [INFO] nitpick registered as external prover.
% 1.62/1.17 % [INFO] Scanning for conjecture ...
% 1.74/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.74/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.74/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.82/1.24 % [INFO] Type checking passed.
% 1.82/1.24 % [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 ...
% 13.04/3.15 % [INFO] Killing All external provers ...
% 13.04/3.15 % Time passed: 2618ms (effective reasoning time: 2179ms)
% 13.04/3.15 % 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)>
% 13.04/3.16 % Axioms used in derivation (0):
% 13.04/3.16 % No. of inferences in proof: 92
% 13.04/3.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2618 ms resp. 2179 ms w/o parsing
% 13.04/3.21 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.04/3.21 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------