TSTP Solution File: SEV034^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV034^5 : TPTP v8.2.0. Released v4.0.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:59:21 EDT 2024
% Result : Theorem 12.05s 3.15s
% Output : Refutation 12.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 42 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 115 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 547 ( 53 ~; 41 |; 17 &; 400 @)
% ( 0 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 124 ( 0 ^ 124 !; 0 ?; 124 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(b_type,type,
b: $tType ).
thf(sk1_type,type,
sk1: a > a > $o ).
thf(sk2_type,type,
sk2: a > b > b > $o ).
thf(sk3_type,type,
sk3: a > b ).
thf(sk4_type,type,
sk4: a > b ).
thf(sk5_type,type,
sk5: a ).
thf(sk6_type,type,
sk6: a ).
thf(1,conjecture,
! [A: a > a > $o,B: a > b > b > $o,C: a > b,D: a > b] :
( ! [E: a] :
( ( A @ E @ E )
=> ( B @ E @ ( C @ E ) @ ( D @ E ) ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( C @ F ) ) )
=> ( ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( A @ F @ E ) )
& ! [E: a,F: a,G: a] :
( ( ( A @ E @ F )
& ( A @ F @ G ) )
=> ( A @ E @ G ) )
& ( A = A ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( ! [G: b,H: b] :
( ( B @ E @ G @ H )
=> ( B @ E @ H @ G ) )
& ! [G: b,H: b,I: b] :
( ( ( B @ E @ G @ H )
& ( B @ E @ H @ I ) )
=> ( B @ E @ G @ I ) )
& ( ( B @ E )
= ( B @ F ) ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM518_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > $o,B: a > b > b > $o,C: a > b,D: a > b] :
( ! [E: a] :
( ( A @ E @ E )
=> ( B @ E @ ( C @ E ) @ ( D @ E ) ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( C @ F ) ) )
=> ( ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( A @ F @ E ) )
& ! [E: a,F: a,G: a] :
( ( ( A @ E @ F )
& ( A @ F @ G ) )
=> ( A @ E @ G ) )
& ( A = A ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( ! [G: b,H: b] :
( ( B @ E @ G @ H )
=> ( B @ E @ H @ G ) )
& ! [G: b,H: b,I: b] :
( ( ( B @ E @ G @ H )
& ( B @ E @ H @ I ) )
=> ( B @ E @ G @ I ) )
& ( ( B @ E )
= ( B @ F ) ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > $o,B: a > b > b > $o,C: a > b,D: a > b] :
( ! [E: a] :
( ( A @ E @ E )
=> ( B @ E @ ( C @ E ) @ ( D @ E ) ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( C @ F ) ) )
=> ( ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( A @ F @ E ) )
& ! [E: a,F: a,G: a] :
( ( ( A @ E @ F )
& ( A @ F @ G ) )
=> ( A @ E @ G ) ) )
=> ( ! [E: a,F: a] :
( ( A @ E @ F )
=> ( ! [G: b,H: b] :
( ( B @ E @ G @ H )
=> ( B @ E @ H @ G ) )
& ! [G: b,H: b,I: b] :
( ( ( B @ E @ G @ H )
& ( B @ E @ H @ I ) )
=> ( B @ E @ G @ I ) )
& ( ( B @ E )
= ( B @ F ) ) ) )
=> ! [E: a,F: a] :
( ( A @ E @ F )
=> ( B @ E @ ( C @ E ) @ ( D @ F ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
sk1 @ sk5 @ sk6,
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk3 @ A ) @ ( sk3 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk2 @ A @ ( sk3 @ A ) @ ( sk3 @ B ) ) ),
inference(simp,[status(thm)],[9]) ).
thf(303,plain,
! [B: a,A: a] :
( ( sk2 @ A @ ( sk3 @ A ) @ ( sk3 @ B ) )
| ( ( sk1 @ sk5 @ sk6 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[8,17]) ).
thf(304,plain,
sk2 @ sk5 @ ( sk3 @ sk5 ) @ ( sk3 @ sk6 ),
inference(pattern_uni,[status(thm)],[303:[bind(A,$thf( sk5 )),bind(B,$thf( sk6 ))]]) ).
thf(10,plain,
! [E: b,D: b,C: b,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk2 @ A @ C @ D )
| ~ ( sk2 @ A @ D @ E )
| ( sk2 @ A @ C @ E ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [E: b,D: b,C: b,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk2 @ A @ C @ D )
| ~ ( sk2 @ A @ D @ E )
| ( sk2 @ A @ C @ E ) ),
inference(simp,[status(thm)],[10]) ).
thf(7,plain,
~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ ( sk4 @ sk6 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(26,plain,
! [E: b,D: b,C: b,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk2 @ A @ C @ D )
| ~ ( sk2 @ A @ D @ E )
| ( ( sk2 @ A @ C @ E )
!= ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ),
inference(paramod_ordered,[status(thm)],[15,7]) ).
thf(27,plain,
! [B: b,A: a] :
( ~ ( sk1 @ sk5 @ A )
| ~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ B )
| ~ ( sk2 @ sk5 @ B @ ( sk4 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( sk5 )),bind(B,$thf( B )),bind(C,$thf( sk3 @ sk5 )),bind(D,$thf( D )),bind(E,$thf( sk4 @ sk6 ))]]) ).
thf(44,plain,
! [B: b,A: a] :
( ~ ( sk1 @ sk5 @ A )
| ~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ B )
| ~ ( sk2 @ sk5 @ B @ ( sk4 @ sk6 ) ) ),
inference(simp,[status(thm)],[27]) ).
thf(50,plain,
! [B: b,A: a] :
( ~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ B )
| ~ ( sk2 @ sk5 @ B @ ( sk4 @ sk6 ) )
| ( ( sk1 @ sk5 @ sk6 )
!= ( sk1 @ sk5 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[8,44]) ).
thf(51,plain,
! [A: b] :
( ~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ A )
| ~ ( sk2 @ sk5 @ A @ ( sk4 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( sk6 ))]]) ).
thf(61,plain,
! [A: b] :
( ~ ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ A )
| ~ ( sk2 @ sk5 @ A @ ( sk4 @ sk6 ) ) ),
inference(simp,[status(thm)],[51]) ).
thf(2006,plain,
! [A: b] :
( ~ ( sk2 @ sk5 @ A @ ( sk4 @ sk6 ) )
| ( ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ ( sk3 @ sk6 ) )
!= ( sk2 @ sk5 @ ( sk3 @ sk5 ) @ A ) ) ),
inference(paramod_ordered,[status(thm)],[304,61]) ).
thf(2007,plain,
~ ( sk2 @ sk5 @ ( sk3 @ sk6 ) @ ( sk4 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[2006:[bind(A,$thf( sk3 @ sk6 ))]]) ).
thf(12,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(18,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ B @ A ) ),
inference(simp,[status(thm)],[12]) ).
thf(22,plain,
! [B: a,A: a] :
( ( sk1 @ B @ A )
| ( ( sk1 @ sk5 @ sk6 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[8,18]) ).
thf(23,plain,
sk1 @ sk6 @ sk5,
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( sk5 )),bind(B,$thf( sk6 ))]]) ).
thf(5,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( ( sk2 @ A )
= ( sk2 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( sk2 @ B ) )
| ~ ( sk1 @ A @ B ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(14,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( sk2 @ B ) )
| ~ ( sk1 @ A @ B ) ),
inference(simp,[status(thm)],[13]) ).
thf(70,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( sk2 @ B ) )
| ( ( sk1 @ sk6 @ sk5 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[23,14]) ).
thf(71,plain,
( ( sk2 @ sk6 )
= ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[70:[bind(A,$thf( sk6 )),bind(B,$thf( sk5 ))]]) ).
thf(75,plain,
! [B: b,A: b] :
( ( sk2 @ sk6 @ A @ B )
= ( sk2 @ sk5 @ A @ B ) ),
inference(func_ext,[status(esa)],[71]) ).
thf(11,plain,
! [A: a] :
( ~ ( sk1 @ A @ A )
| ( sk2 @ A @ ( sk3 @ A ) @ ( sk4 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(119,plain,
! [C: a,B: b,A: b] :
( ~ ( sk1 @ C @ C )
| ( sk2 @ sk5 @ A @ B )
| ( ( sk2 @ sk6 @ A @ B )
!= ( sk2 @ C @ ( sk3 @ C ) @ ( sk4 @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[75,11]) ).
thf(120,plain,
( ~ ( sk1 @ sk6 @ sk6 )
| ( sk2 @ sk5 @ ( sk3 @ sk6 ) @ ( sk4 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[119:[bind(A,$thf( sk3 @ sk6 )),bind(B,$thf( sk4 @ sk6 )),bind(C,$thf( sk6 ))]]) ).
thf(4,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk1 @ B @ C )
| ( sk1 @ A @ C ) ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ~ ( sk1 @ B @ C )
| ( sk1 @ A @ C ) ),
inference(simp,[status(thm)],[4]) ).
thf(411,plain,
! [C: a,B: a,A: a] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ A @ C )
| ( ( sk1 @ sk5 @ sk6 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[8,19]) ).
thf(412,plain,
! [A: a] :
( ~ ( sk1 @ A @ sk5 )
| ( sk1 @ A @ sk6 ) ),
inference(pattern_uni,[status(thm)],[411:[bind(A,$thf( A )),bind(B,$thf( sk5 )),bind(C,$thf( sk6 ))]]) ).
thf(880,plain,
! [A: a] :
( ( sk1 @ A @ sk6 )
| ( ( sk1 @ sk6 @ sk5 )
!= ( sk1 @ A @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[23,412]) ).
thf(881,plain,
sk1 @ sk6 @ sk6,
inference(pattern_uni,[status(thm)],[880:[bind(A,$thf( sk6 ))]]) ).
thf(898,plain,
( ~ $true
| ( sk2 @ sk5 @ ( sk3 @ sk6 ) @ ( sk4 @ sk6 ) ) ),
inference(rewrite,[status(thm)],[120,881]) ).
thf(899,plain,
sk2 @ sk5 @ ( sk3 @ sk6 ) @ ( sk4 @ sk6 ),
inference(simp,[status(thm)],[898]) ).
thf(2063,plain,
~ $true,
inference(rewrite,[status(thm)],[2007,899]) ).
thf(2064,plain,
$false,
inference(simp,[status(thm)],[2063]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV034^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 18:40:10 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.97/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.97 % [INFO] Parsing done (104ms).
% 1.19/0.97 % [INFO] Running in sequential loop mode.
% 1.48/1.17 % [INFO] nitpick registered as external prover.
% 1.65/1.18 % [INFO] Scanning for conjecture ...
% 1.88/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.88/1.27 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.88/1.28 % [INFO] Problem is higher-order (TPTP THF).
% 1.88/1.28 % [INFO] Type checking passed.
% 1.88/1.28 % [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 ...
% 12.05/3.15 % [INFO] Killing All external provers ...
% 12.05/3.15 % Time passed: 2617ms (effective reasoning time: 2170ms)
% 12.05/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)>
% 12.05/3.15 % Axioms used in derivation (0):
% 12.05/3.15 % No. of inferences in proof: 42
% 12.05/3.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2617 ms resp. 2170 ms w/o parsing
% 12.05/3.19 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.05/3.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------