TSTP Solution File: SYO264^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SYO264^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n018.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 20:54:50 EDT 2024
% Result : Theorem 29.76s 5.44s
% Output : Refutation 29.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 1
% Syntax : Number of formulae : 44 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 170 ( 26 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 463 ( 116 ~; 74 |; 9 &; 264 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 107 ( 39 ^ 62 !; 6 ?; 107 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk4_type,type,
sk4: $i > $o ).
thf(sk5_type,type,
sk5: ( $i > $o ) > ( $i > $o ) > $o ).
thf(sk6_type,type,
sk6: ( $i > $o ) > ( $i > $o ) > $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i > $o] :
? [E: $i > $o,F: $i > $o] :
( ( ( E @ A )
| ( F @ A ) )
& ( ( D @ B )
| ( F @ B ) )
& ( ( E @ C )
| ~ ( D @ C ) )
& ! [G: $i] :
( ( F @ G )
= ( ~ ( D @ G ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM125C) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i > $o] :
? [E: $i > $o,F: $i > $o] :
( ( ( E @ A )
| ( F @ A ) )
& ( ( D @ B )
| ( F @ B ) )
& ( ( E @ C )
| ~ ( D @ C ) )
& ! [G: $i] :
( ( F @ G )
= ( ~ ( D @ G ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i,C: $i,D: $i > $o] :
? [E: $i > $o,F: $i > $o] :
( ( ( E @ A )
| ( F @ A ) )
& ( ( D @ B )
| ( F @ B ) )
& ( ( E @ C )
| ~ ( D @ C ) )
& ! [G: $i] :
( ( F @ G )
= ( ~ ( D @ G ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
! [B: $i > $o,A: $i > $o] :
( ( sk5 @ B @ A )
| ~ ( B @ sk2 )
| ~ ( A @ sk3 )
| ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ( sk5 @ B @ A )
| ~ ( B @ sk2 )
| ~ ( A @ sk3 ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(5,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( B @ sk1 )
| ~ ( sk5 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ~ ( B @ sk1 )
| ~ ( sk5
@ ^ [C: $i] :
~ ( B @ C )
@ A ) ),
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ~ ( C @ D ) ))]]) ).
thf(30,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( sk5
@ ^ [C: $i] :
~ ( B @ C )
@ A )
| ( B @ sk1 ) ),
inference(cnf,[status(esa)],[15]) ).
thf(31,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( sk5
@ ^ [C: $i] :
~ ( B @ C )
@ A )
| ( B @ sk1 ) ),
inference(simp,[status(thm)],[30]) ).
thf(66,plain,
! [A: $i > $o] :
( ~ ( sk5
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A )
| ( sk4 @ sk1 ) ),
inference(prim_subst,[status(thm)],[31:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).
thf(155,plain,
! [C: $i > $o,B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ~ ( B @ sk2 )
| ~ ( A @ sk3 )
| ( sk4 @ sk1 )
| ( ( sk5 @ B @ A )
!= ( sk5
@ ^ [D: $i] :
~ ( sk4 @ D )
@ C ) ) ),
inference(paramod_ordered,[status(thm)],[10,66]) ).
thf(156,plain,
! [A: $i > $o] :
( ( ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) )
!= ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) ) )
| ~ ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 )
| ( sk4 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[155:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ~ ( sk4 @ D ) )),bind(C,$thf( A ))]]) ).
thf(219,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ~ ( A @ sk3 )
| ( sk4 @ sk2 )
| ( ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) )
!= ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) ) ) ),
inference(cnf,[status(esa)],[156]) ).
thf(220,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ~ ( A @ sk3 )
| ( sk4 @ sk2 ) ),
inference(simp,[status(thm)],[219]) ).
thf(292,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ( sk4 @ sk2 )
| ( ( A @ sk3 )
!= ( ~ ( sk4 @ sk1 ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[220]) ).
thf(302,plain,
( ( sk4 @ sk1 )
| ( sk4 @ sk2 ) ),
inference(pre_uni,[status(thm)],[292:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ sk1 ) ))]]) ).
thf(4,plain,
! [B: $i > $o,A: $i > $o] :
( ( sk5 @ B @ A )
| ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 )
| ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ( sk5 @ B @ A )
| ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(786,plain,
! [C: $i > $o,B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 )
| ( sk4 @ sk1 )
| ( ( sk5 @ B @ A )
!= ( sk5
@ ^ [D: $i] :
~ ( sk4 @ D )
@ C ) ) ),
inference(paramod_ordered,[status(thm)],[13,66]) ).
thf(787,plain,
! [A: $i > $o] :
( ( ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) )
!= ( ~ ( sk4
@ ( sk6
@ ^ [B: $i] :
~ ( sk4 @ B )
@ A ) ) ) )
| ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 )
| ( sk4 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[786:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ~ ( sk4 @ D ) )),bind(C,$thf( A ))]]) ).
thf(866,plain,
! [A: $i > $o] :
( ~ ( sk4 @ sk2 )
| ~ ( A @ sk3 )
| ( sk4 @ sk1 ) ),
inference(simp,[status(thm)],[787]) ).
thf(1144,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ~ ( A @ sk3 )
| ( ( sk4 @ sk2 )
!= ( sk4 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[302,866]) ).
thf(1145,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ~ ( A @ sk3 ) ),
inference(pattern_uni,[status(thm)],[1144:[]]) ).
thf(1243,plain,
! [A: $i > $o] :
( ( sk4 @ sk1 )
| ( ( A @ sk3 )
!= ( ~ ( sk4 @ sk1 ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[1145]) ).
thf(1268,plain,
sk4 @ sk1,
inference(pre_uni,[status(thm)],[1243:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ sk1 ) ))]]) ).
thf(1366,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ( sk5 @ B @ A )
| ~ ( sk4 @ sk2 )
| ( ( sk4 @ sk1 )
!= ( A @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[1268,13]) ).
thf(1390,plain,
! [A: $i > $o] :
( ( ( A
@ ( sk6 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ) )
!= ( ~ ( sk4
@ ( sk6 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ) ) ) )
| ( sk5 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) )
| ~ ( sk4 @ sk2 ) ),
inference(pre_uni,[status(thm)],[1366:[bind(A,$thf( ^ [C: $i] : ( sk4 @ sk1 ) )),bind(B,$thf( B ))]]) ).
thf(1391,plain,
( ~ ( sk4 @ sk2 )
| ( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : ( sk4 @ sk1 ) ) ),
inference(pre_uni,[status(thm)],[1390:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ B ) ))]]) ).
thf(1362,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( B @ ( sk6 @ B @ A ) )
!= ( ~ ( sk4 @ ( sk6 @ B @ A ) ) ) )
| ( sk5 @ B @ A )
| ~ ( B @ sk2 )
| ( ( sk4 @ sk1 )
!= ( A @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[1268,10]) ).
thf(1377,plain,
! [A: $i > $o] :
( ( ( A
@ ( sk6 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ) )
!= ( ~ ( sk4
@ ( sk6 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ) ) ) )
| ( sk5 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) )
| ~ ( A @ sk2 ) ),
inference(pre_uni,[status(thm)],[1362:[bind(A,$thf( ^ [C: $i] : ( sk4 @ sk1 ) )),bind(B,$thf( B ))]]) ).
thf(1378,plain,
( ~ ~ ( sk4 @ sk2 )
| ( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : ( sk4 @ sk1 ) ) ),
inference(pre_uni,[status(thm)],[1377:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ B ) ))]]) ).
thf(1400,plain,
( ( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : ( sk4 @ sk1 ) )
| ( sk4 @ sk2 ) ),
inference(cnf,[status(esa)],[1378]) ).
thf(1649,plain,
( ( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : $true )
| ( sk4 @ sk2 ) ),
inference(rewrite,[status(thm)],[1400,1268]) ).
thf(7,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( A @ sk1 )
| ~ ( sk5 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(1371,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( sk5 @ B @ A )
| ( ( sk4 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[1268,7]) ).
thf(1395,plain,
! [A: $i > $o] :
~ ( sk5 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ),
inference(pre_uni,[status(thm)],[1371:[bind(A,$thf( ^ [C: $i] : ( sk4 @ sk1 ) )),bind(B,$thf( B ))]]) ).
thf(1401,plain,
! [A: $i > $o] :
~ ( sk5 @ A
@ ^ [B: $i] : ( sk4 @ sk1 ) ),
inference(simp,[status(thm)],[1395]) ).
thf(1531,plain,
! [A: $i > $o] :
~ ( sk5 @ A
@ ^ [B: $i] : $true ),
inference(rewrite,[status(thm)],[1401,1268]) ).
thf(1668,plain,
! [A: $i > $o] :
( ( sk4 @ sk2 )
| ( ( sk5
@ ^ [B: $i] :
~ ( sk4 @ B )
@ ^ [B: $i] : $true )
!= ( sk5 @ A
@ ^ [B: $i] : $true ) ) ),
inference(paramod_ordered,[status(thm)],[1649,1531]) ).
thf(1669,plain,
sk4 @ sk2,
inference(pattern_uni,[status(thm)],[1668:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ B ) ))]]) ).
thf(2559,plain,
( ~ $true
| ( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : $true ) ),
inference(rewrite,[status(thm)],[1391,1268,1669]) ).
thf(2560,plain,
( sk5
@ ^ [A: $i] :
~ ( sk4 @ A )
@ ^ [A: $i] : $true ),
inference(simp,[status(thm)],[2559]) ).
thf(2570,plain,
! [A: $i > $o] :
( ( sk5
@ ^ [B: $i] :
~ ( sk4 @ B )
@ ^ [B: $i] : $true )
!= ( sk5 @ A
@ ^ [B: $i] : $true ) ),
inference(paramod_ordered,[status(thm)],[2560,1531]) ).
thf(2571,plain,
$false,
inference(pattern_uni,[status(thm)],[2570:[bind(A,$thf( ^ [B: $i] : ~ ( sk4 @ B ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO264^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_Leo-III %s %d SAT
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Jun 23 08:40:10 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.96/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.23/1.00 % [INFO] Parsing done (102ms).
% 1.23/1.01 % [INFO] Running in sequential loop mode.
% 1.64/1.22 % [INFO] nitpick registered as external prover.
% 1.64/1.23 % [INFO] Scanning for conjecture ...
% 1.86/1.28 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.86/1.31 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.86/1.31 % [INFO] Problem is higher-order (TPTP THF).
% 1.86/1.31 % [INFO] Type checking passed.
% 1.86/1.31 % [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 ...
% 29.76/5.43 % [INFO] Killing All external provers ...
% 29.76/5.43 % Time passed: 4886ms (effective reasoning time: 4421ms)
% 29.76/5.43 % 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)>
% 29.76/5.44 % Axioms used in derivation (0):
% 29.76/5.44 % No. of inferences in proof: 44
% 29.76/5.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4886 ms resp. 4421 ms w/o parsing
% 29.76/5.50 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 29.76/5.50 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------