TSTP Solution File: SEV126^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV126^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 15:59:34 EDT 2024
% Result : Theorem 29.66s 5.38s
% Output : Refutation 29.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 6 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 425 ( 35 ~; 50 |; 12 &; 301 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 103 ( 0 ^ 103 !; 0 ?; 103 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: ( a > a > $o ) > $o ).
thf(sk2_type,type,
sk2: a > a > $o ).
thf(sk3_type,type,
sk3: a > a > $o ).
thf(sk4_type,type,
sk4: a ).
thf(sk5_type,type,
sk5: a ).
thf(sk6_type,type,
sk6: ( a > a > $o ) > a ).
thf(sk7_type,type,
sk7: ( a > a > $o ) > a ).
thf(sk8_type,type,
sk8: a > a > $o ).
thf(sk9_type,type,
sk9: a > a > a > a > $o ).
thf(sk10_type,type,
sk10: a > a > a > a > $o ).
thf(1,conjecture,
! [A: ( a > a > $o ) > $o,B: a > a > $o,C: a > a > $o,D: a,E: a] :
( ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ( B @ G @ H )
| ( C @ G @ H ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) )
=> ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( B @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) )
| ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( C @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM252B_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( a > a > $o ) > $o,B: a > a > $o,C: a > a > $o,D: a,E: a] :
( ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ( B @ G @ H )
| ( C @ G @ H ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) )
=> ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( B @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) )
| ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( C @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: ( a > a > $o ) > $o,B: a > a > $o,C: a > a > $o,D: a,E: a] :
( ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ( B @ G @ H )
| ( C @ G @ H ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) )
=> ! [F: a > a > $o] :
( ( ! [G: a,H: a] :
( ( ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( B @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) )
| ! [I: a > a > $o] :
( ( ! [J: a,K: a] :
( ( C @ J @ K )
=> ( I @ J @ K ) )
& ( A @ I ) )
=> ( I @ G @ H ) ) )
=> ( F @ G @ H ) )
& ( A @ F ) )
=> ( F @ D @ E ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(13,plain,
! [D: a,C: a,B: a,A: a] :
( ~ ( sk2 @ C @ D )
| ( sk9 @ B @ A @ C @ D )
| ( sk8 @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(18,plain,
! [D: a,C: a,B: a,A: a] :
( ~ ( sk2 @ C @ D )
| ( sk9 @ B @ A @ C @ D )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[13]) ).
thf(8,plain,
! [B: a,A: a] :
( ~ ( sk9 @ B @ A @ A @ B )
| ( sk8 @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [B: a,A: a] :
( ~ ( sk9 @ B @ A @ A @ B )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[8]) ).
thf(399,plain,
! [F: a,E: a,D: a,C: a,B: a,A: a] :
( ~ ( sk2 @ C @ D )
| ( sk8 @ A @ B )
| ( sk8 @ E @ F )
| ( ( sk9 @ B @ A @ C @ D )
!= ( sk9 @ F @ E @ E @ F ) ) ),
inference(paramod_ordered,[status(thm)],[18,19]) ).
thf(400,plain,
! [B: a,A: a] :
( ~ ( sk2 @ A @ B )
| ( sk8 @ A @ B )
| ( sk8 @ A @ B ) ),
inference(pattern_uni,[status(thm)],[399:[bind(A,$thf( C )),bind(B,$thf( D )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( C )),bind(F,$thf( D ))]]) ).
thf(410,plain,
! [B: a,A: a] :
( ~ ( sk2 @ A @ B )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[400]) ).
thf(4,plain,
sk1 @ sk8,
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
! [A: a > a > $o] :
( ~ ( A @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ~ ( sk1 @ A )
| ( A @ sk4 @ sk5 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(30,plain,
! [A: a > a > $o] :
( ~ ( A @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ( A @ sk4 @ sk5 )
| ( ( sk1 @ sk8 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[4,12]) ).
thf(31,plain,
( ~ ( sk8 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| ( sk8 @ sk4 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( sk8 ))]]) ).
thf(11,plain,
~ ( sk8 @ sk4 @ sk5 ),
inference(cnf,[status(esa)],[3]) ).
thf(157,plain,
( ~ ( sk8 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| $false ),
inference(rewrite,[status(thm)],[31,11]) ).
thf(158,plain,
~ ( sk8 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ),
inference(simp,[status(thm)],[157]) ).
thf(906,plain,
! [B: a,A: a] :
( ~ ( sk2 @ A @ B )
| ( ( sk8 @ A @ B )
!= ( sk8 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ) ) ),
inference(paramod_ordered,[status(thm)],[410,158]) ).
thf(907,plain,
~ ( sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ),
inference(pattern_uni,[status(thm)],[906:[bind(A,$thf( sk6 @ sk8 )),bind(B,$thf( sk7 @ sk8 ))]]) ).
thf(7,plain,
! [A: a > a > $o] :
( ( sk2 @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ( sk3 @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ~ ( sk1 @ A )
| ( A @ sk4 @ sk5 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(107,plain,
! [A: a > a > $o] :
( ( sk2 @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ( sk3 @ ( sk6 @ A ) @ ( sk7 @ A ) )
| ( A @ sk4 @ sk5 )
| ( ( sk1 @ sk8 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[4,7]) ).
thf(108,plain,
( ( sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| ( sk3 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| ( sk8 @ sk4 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[107:[bind(A,$thf( sk8 ))]]) ).
thf(201,plain,
( ( sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| ( sk3 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| $false ),
inference(rewrite,[status(thm)],[108,11]) ).
thf(202,plain,
( ( sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| ( sk3 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ) ),
inference(simp,[status(thm)],[201]) ).
thf(10,plain,
! [D: a,C: a,B: a,A: a] :
( ~ ( sk3 @ C @ D )
| ( sk10 @ B @ A @ C @ D )
| ( sk8 @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [D: a,C: a,B: a,A: a] :
( ~ ( sk3 @ C @ D )
| ( sk10 @ B @ A @ C @ D )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[10]) ).
thf(5,plain,
! [B: a,A: a] :
( ~ ( sk10 @ B @ A @ A @ B )
| ( sk8 @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(14,plain,
! [B: a,A: a] :
( ~ ( sk10 @ B @ A @ A @ B )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[5]) ).
thf(276,plain,
! [F: a,E: a,D: a,C: a,B: a,A: a] :
( ~ ( sk3 @ C @ D )
| ( sk8 @ A @ B )
| ( sk8 @ E @ F )
| ( ( sk10 @ B @ A @ C @ D )
!= ( sk10 @ F @ E @ E @ F ) ) ),
inference(paramod_ordered,[status(thm)],[15,14]) ).
thf(277,plain,
! [B: a,A: a] :
( ~ ( sk3 @ A @ B )
| ( sk8 @ A @ B )
| ( sk8 @ A @ B ) ),
inference(pattern_uni,[status(thm)],[276:[bind(A,$thf( C )),bind(B,$thf( D )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( C )),bind(F,$thf( D ))]]) ).
thf(288,plain,
! [B: a,A: a] :
( ~ ( sk3 @ A @ B )
| ( sk8 @ A @ B ) ),
inference(simp,[status(thm)],[277]) ).
thf(304,plain,
! [B: a,A: a] :
( ~ ( sk3 @ A @ B )
| ( ( sk8 @ A @ B )
!= ( sk8 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ) ) ),
inference(paramod_ordered,[status(thm)],[288,158]) ).
thf(305,plain,
~ ( sk3 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) ),
inference(pattern_uni,[status(thm)],[304:[bind(A,$thf( sk6 @ sk8 )),bind(B,$thf( sk7 @ sk8 ))]]) ).
thf(328,plain,
( ( sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ) )
| $false ),
inference(rewrite,[status(thm)],[202,305]) ).
thf(329,plain,
sk2 @ ( sk6 @ sk8 ) @ ( sk7 @ sk8 ),
inference(simp,[status(thm)],[328]) ).
thf(1213,plain,
~ $true,
inference(rewrite,[status(thm)],[907,329]) ).
thf(1214,plain,
$false,
inference(simp,[status(thm)],[1213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV126^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 18:31:10 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.92/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.95 % [INFO] Parsing done (105ms).
% 1.20/0.96 % [INFO] Running in sequential loop mode.
% 1.55/1.16 % [INFO] nitpick registered as external prover.
% 1.55/1.17 % [INFO] Scanning for conjecture ...
% 1.66/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.87/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.87/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.87/1.26 % [INFO] Type checking passed.
% 1.95/1.26 % [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.66/5.37 % [INFO] Killing All external provers ...
% 29.66/5.37 % Time passed: 4855ms (effective reasoning time: 4408ms)
% 29.66/5.37 % 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.66/5.38 % Axioms used in derivation (0):
% 29.66/5.38 % No. of inferences in proof: 37
% 29.66/5.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4855 ms resp. 4408 ms w/o parsing
% 29.66/5.44 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 29.66/5.45 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------