TSTP Solution File: SEU704^2 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEU704^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n019.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:32:43 EDT 2024
% Result : Theorem 11.15s 2.94s
% Output : Refutation 11.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 12 unt; 0 typ; 5 def)
% Number of atoms : 301 ( 140 equ; 0 cnn)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 708 ( 138 ~; 110 |; 86 &; 332 @)
% ( 0 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 158 ( 56 ^ 100 !; 2 ?; 158 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(emptyset_type,type,
emptyset: $i ).
thf(setadjoin_type,type,
setadjoin: $i > $i > $i ).
thf(dsetconstr_type,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(singleton_type,type,
singleton: $i > $o ).
thf(singleton_def,definition,
( singleton
= ( ^ [A: $i] :
? [B: $i] :
( ( in @ B @ A )
& ( A
= ( setadjoin @ B @ emptyset ) ) ) ) ) ).
thf(iffalseProp1_type,type,
iffalseProp1: $o ).
thf(iffalseProp1_def,definition,
( iffalseProp1
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( in @ D
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ).
thf(iffalseProp2_type,type,
iffalseProp2: $o ).
thf(iffalseProp2_def,definition,
( iffalseProp2
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ D @ emptyset ) ) ) ) ) ) ) ).
thf(iftrueProp1_type,type,
iftrueProp1: $o ).
thf(iftrueProp1_def,definition,
( iftrueProp1
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ).
thf(iftrueProp2_type,type,
iftrueProp2: $o ).
thf(iftrueProp2_def,definition,
( iftrueProp2
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) ) ) ) ) ) ) ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $o ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(1,conjecture,
( iffalseProp1
=> ( iffalseProp2
=> ( iftrueProp1
=> ( iftrueProp2
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( singleton
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifSingleton) ).
thf(2,negated_conjecture,
~ ( iffalseProp1
=> ( iffalseProp2
=> ( iftrueProp1
=> ( iftrueProp2
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( singleton
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( in @ D
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ D @ emptyset ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) ) ) ) )
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ? [E: $i] :
( ( in @ E
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( B
& ( F = C ) )
| ( ~ B
& ( F = D ) ) ) ) )
& ( ( dsetconstr @ A
@ ^ [F: $i] :
( ( B
& ( F = C ) )
| ( ~ B
& ( F = D ) ) ) )
= ( setadjoin @ E @ emptyset ) ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(10,plain,
in @ sk3 @ sk1,
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) )
| ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B ),
inference(lifteq,[status(thm)],[8]) ).
thf(16,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) )
| ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B ),
inference(simp,[status(thm)],[15]) ).
thf(5,plain,
in @ sk4 @ sk1,
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ),
inference(simp,[status(thm)],[4]) ).
thf(45,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ B @ A )
| ~ ( in @ C @ A )
| ~ $true
| ( in @ B
@ ( dsetconstr @ A
@ ^ [D: $i] :
( ( $true
& ( D = B ) )
| ( ~ $true
& ( D = C ) ) ) ) ) ),
inference(prim_subst,[status(thm)],[17:[bind(A,$thf( A )),bind(B,$thf( $true ))]]) ).
thf(59,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ B @ A )
| ~ ( in @ C @ A )
| ( in @ B
@ ( dsetconstr @ A
@ ^ [D: $i] : ( D = B ) ) ) ),
inference(simp,[status(thm)],[45]) ).
thf(168,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ( in @ B
@ ( dsetconstr @ A
@ ^ [D: $i] : ( D = B ) ) )
| ( ( in @ sk4 @ sk1 )
!= ( in @ B @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5,59]) ).
thf(169,plain,
! [A: $i] :
( ~ ( in @ A @ sk1 )
| ( in @ sk4
@ ( dsetconstr @ sk1
@ ^ [B: $i] : ( B = sk4 ) ) ) ),
inference(pattern_uni,[status(thm)],[168:[bind(A,$thf( sk1 )),bind(B,$thf( sk4 ))]]) ).
thf(209,plain,
! [A: $i] :
( ~ ( in @ A @ sk1 )
| ( in @ sk4
@ ( dsetconstr @ sk1
@ ^ [B: $i] : ( B = sk4 ) ) ) ),
inference(simp,[status(thm)],[169]) ).
thf(222,plain,
! [A: $i] :
( ( in @ sk4
@ ( dsetconstr @ sk1
@ ^ [B: $i] : ( B = sk4 ) ) )
| ( ( in @ sk4 @ sk1 )
!= ( in @ A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[5,209]) ).
thf(223,plain,
( in @ sk4
@ ( dsetconstr @ sk1
@ ^ [A: $i] : ( A = sk4 ) ) ),
inference(pattern_uni,[status(thm)],[222:[bind(A,$thf( sk4 ))]]) ).
thf(9,plain,
! [A: $i] :
( ~ ( in @ A
@ ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) ) )
| ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( setadjoin @ A @ emptyset ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [A: $i] :
( ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( setadjoin @ A @ emptyset ) )
| ~ ( in @ A
@ ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) ) ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(14,plain,
! [A: $i] :
( ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( setadjoin @ A @ emptyset ) )
| ~ ( in @ A
@ ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) ) ) ),
inference(simp,[status(thm)],[13]) ).
thf(415,plain,
! [A: $i] :
( ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( setadjoin @ A @ emptyset ) )
| ( ( in @ sk4
@ ( dsetconstr @ sk1
@ ^ [B: $i] : ( B = sk4 ) ) )
!= ( in @ A
@ ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[223,14]) ).
thf(434,plain,
! [A: $i] :
( ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( setadjoin @ A @ emptyset ) )
| ( sk4 != A )
| ( ( dsetconstr @ sk1
@ ^ [B: $i] :
( ( sk2
& ( B = sk3 ) )
| ( ~ sk2
& ( B = sk4 ) ) ) )
!= ( dsetconstr @ sk1
@ ^ [B: $i] : ( B = sk4 ) ) ) ),
inference(simp,[status(thm)],[415]) ).
thf(438,plain,
( ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( sk2
& ( A = sk3 ) )
| ( ~ sk2
& ( A = sk4 ) ) ) )
!= ( setadjoin @ sk4 @ emptyset ) )
| ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( sk2
& ( A = sk3 ) )
| ( ~ sk2
& ( A = sk4 ) ) ) )
!= ( dsetconstr @ sk1
@ ^ [A: $i] : ( A = sk4 ) ) ) ),
inference(simp,[status(thm)],[434]) ).
thf(33,plain,
! [E: $i,D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ( ( dsetconstr @ sk1
@ ^ [F: $i] :
( ( sk2
& ( F = sk3 ) )
| ( ~ sk2
& ( F = sk4 ) ) ) )
!= ( setadjoin @ E @ emptyset ) )
| ( ( in @ C
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( B
& ( F = C ) )
| ( ~ B
& ( F = D ) ) ) ) )
!= ( in @ E
@ ( dsetconstr @ sk1
@ ^ [F: $i] :
( ( sk2
& ( F = sk3 ) )
| ( ~ sk2
& ( F = sk4 ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[17,14]) ).
thf(34,plain,
( ~ ( in @ sk3 @ sk1 )
| ~ ( in @ sk4 @ sk1 )
| ~ sk2
| ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( sk2
& ( A = sk3 ) )
| ( ~ sk2
& ( A = sk4 ) ) ) )
!= ( setadjoin @ sk3 @ emptyset ) ) ),
inference(pattern_uni,[status(thm)],[33:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind(D,$thf( sk4 )),bind(E,$thf( sk3 ))]]) ).
thf(533,plain,
( ~ $true
| ~ $true
| ~ sk2
| ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( sk2
& ( A = sk3 ) )
| ( ~ sk2
& ( A = sk4 ) ) ) )
!= ( setadjoin @ sk3 @ emptyset ) ) ),
inference(rewrite,[status(thm)],[34,5,10]) ).
thf(534,plain,
( ~ sk2
| ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( sk2
& ( A = sk3 ) )
| ( ~ sk2
& ( A = sk4 ) ) ) )
!= ( setadjoin @ sk3 @ emptyset ) ) ),
inference(simp,[status(thm)],[533]) ).
thf(646,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ~ sk2
| ( ( setadjoin @ C @ emptyset )
!= ( setadjoin @ sk3 @ emptyset ) )
| ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
!= ( dsetconstr @ sk1
@ ^ [E: $i] :
( ( sk2
& ( E = sk3 ) )
| ( ~ sk2
& ( E = sk4 ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,534]) ).
thf(647,plain,
( ~ ( in @ sk3 @ sk1 )
| ~ ( in @ sk4 @ sk1 )
| ~ sk2
| ~ sk2
| ( ( setadjoin @ sk3 @ emptyset )
!= ( setadjoin @ sk3 @ emptyset ) ) ),
inference(pattern_uni,[status(thm)],[646:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind(D,$thf( sk4 ))]]) ).
thf(726,plain,
( ~ ( in @ sk3 @ sk1 )
| ~ ( in @ sk4 @ sk1 )
| ~ sk2 ),
inference(simp,[status(thm)],[647]) ).
thf(867,plain,
( ~ $true
| ~ $true
| ~ sk2 ),
inference(rewrite,[status(thm)],[726,5,10]) ).
thf(868,plain,
~ sk2,
inference(simp,[status(thm)],[867]) ).
thf(875,plain,
( ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( $false
& ( A = sk3 ) )
| ( ~ $false
& ( A = sk4 ) ) ) )
!= ( setadjoin @ sk4 @ emptyset ) )
| ( ( dsetconstr @ sk1
@ ^ [A: $i] :
( ( $false
& ( A = sk3 ) )
| ( ~ $false
& ( A = sk4 ) ) ) )
!= ( dsetconstr @ sk1
@ ^ [A: $i] : ( A = sk4 ) ) ) ),
inference(rewrite,[status(thm)],[438,868]) ).
thf(876,plain,
( ( dsetconstr @ sk1
@ ^ [A: $i] : ( A = sk4 ) )
!= ( setadjoin @ sk4 @ emptyset ) ),
inference(simp,[status(thm)],[875]) ).
thf(880,plain,
! [D: $i,C: $i,B: $o,A: $i] :
( ~ ( in @ C @ A )
| ~ ( in @ D @ A )
| ~ B
| ( ( setadjoin @ C @ emptyset )
!= ( setadjoin @ sk4 @ emptyset ) )
| ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
!= ( dsetconstr @ sk1
@ ^ [E: $i] : ( E = sk4 ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,876]) ).
thf(887,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ B @ A )
| ~ ( in @ C @ A )
| ( B != sk4 )
| ( emptyset != emptyset )
| ( A != sk1 )
| ( ( ^ [D: $i] :
( ( $true
& ( D = B ) )
| ( ~ $true
& ( D = C ) ) ) )
!= ( ^ [D: $i] : ( D = sk4 ) ) ) ),
inference(simp,[status(thm)],[880]) ).
thf(894,plain,
! [A: $i] :
( ~ ( in @ sk4 @ sk1 )
| ~ ( in @ A @ sk1 ) ),
inference(simp,[status(thm)],[887]) ).
thf(944,plain,
! [A: $i] :
( ~ $true
| ~ ( in @ A @ sk1 ) ),
inference(rewrite,[status(thm)],[894,5]) ).
thf(945,plain,
! [A: $i] :
~ ( in @ A @ sk1 ),
inference(simp,[status(thm)],[944]) ).
thf(948,plain,
$false,
inference(rewrite,[status(thm)],[10,945]) ).
thf(949,plain,
$false,
inference(simp,[status(thm)],[948]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU704^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_Leo-III %s %d SAT
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 13:20:55 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.95/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.16/0.98 % [INFO] Parsing done (106ms).
% 1.16/0.99 % [INFO] Running in sequential loop mode.
% 1.65/1.19 % [INFO] nitpick registered as external prover.
% 1.65/1.19 % [INFO] Scanning for conjecture ...
% 1.87/1.27 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.00/1.29 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.00/1.29 % [INFO] Problem is higher-order (TPTP THF).
% 2.00/1.29 % [INFO] Type checking passed.
% 2.00/1.29 % [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 ...
% 11.15/2.93 % [INFO] Killing All external provers ...
% 11.15/2.93 % Time passed: 2388ms (effective reasoning time: 1938ms)
% 11.15/2.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)>
% 11.15/2.94 % Axioms used in derivation (0):
% 11.15/2.94 % No. of inferences in proof: 41
% 11.15/2.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2388 ms resp. 1938 ms w/o parsing
% 11.15/2.99 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.15/2.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------