TSTP Solution File: SEV162^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV162^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n020.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:38 EDT 2024
% Result : Theorem 4.78s 2.03s
% Output : Refutation 4.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 8 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 115 ( 14 ~; 7 |; 0 &; 94 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 106 ( 72 ^ 34 !; 0 ?; 106 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: ( a > a > a ) > a ).
thf(1,conjecture,
! [A: a > a > $o] :
( ( ! [B: a,C: a] : ( A @ B @ C ) )
= ( ! [B: ( a > a > a ) > a] :
( A
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM184_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > $o] :
( ( ! [B: a,C: a] : ( A @ B @ C ) )
= ( ! [B: ( a > a > a ) > a] :
( A
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > $o] :
( ( ! [B: a,C: a] : ( A @ B @ C ) )
= ( ! [B: ( a > a > a ) > a] :
( A
@ ( B
@ ^ [C: a,D: a] : C )
@ ( B
@ ^ [C: a,D: a] : D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [A: a,B: a] : ( sk1 @ A @ B ) )
!= ( ! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [A: a,B: a] : ( sk1 @ A @ B ) )
!= ( ! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ! [A: a,B: a] : ( sk1 @ A @ B )
| ! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
! [C: ( a > a > a ) > a,B: a,A: a] :
( ( sk1
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) )
| ( sk1 @ A @ B ) ),
inference(cnf,[status(esa)],[7]) ).
thf(26,plain,
! [C: ( a > a > a ) > a,B: a,A: a] :
( ( sk1
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) )
| ( ( sk1 @ A @ B )
!= ( sk1
@ ( C
@ ^ [D: a,E: a] : D )
@ ( C
@ ^ [D: a,E: a] : E ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[9]) ).
thf(43,plain,
! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ),
inference(pre_uni,[status(thm)],[26:[bind(A,$thf( C @ ^ [D: a] : ^ [E: a] : D )),bind(B,$thf( C @ ^ [D: a] : ^ [E: a] : E ))]]) ).
thf(44,plain,
! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ),
inference(simp,[status(thm)],[43]) ).
thf(6,plain,
( ~ ! [A: a,B: a] : ( sk1 @ A @ B )
| ~ ! [A: ( a > a > a ) > a] :
( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ~ ( sk1
@ ( sk4
@ ^ [A: a,B: a] : A )
@ ( sk4
@ ^ [A: a,B: a] : B ) )
| ~ ( sk1 @ sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(61,plain,
! [A: ( a > a > a ) > a] :
( ~ ( sk1
@ ( sk4
@ ^ [B: a,C: a] : B )
@ ( sk4
@ ^ [B: a,C: a] : C ) )
| ( ( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) )
!= ( sk1 @ sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[44,8]) ).
thf(66,plain,
~ ( sk1
@ ( sk4
@ ^ [A: a,B: a] : A )
@ ( sk4
@ ^ [A: a,B: a] : B ) ),
inference(pre_uni,[status(thm)],[61:[bind(A,$thf( ^ [B: a > a > a] : ( B @ sk2 @ sk3 ) ))]]) ).
thf(86,plain,
! [A: ( a > a > a ) > a] :
( ( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) )
!= ( sk1
@ ( sk4
@ ^ [B: a,C: a] : B )
@ ( sk4
@ ^ [B: a,C: a] : C ) ) ),
inference(paramod_ordered,[status(thm)],[44,66]) ).
thf(93,plain,
$false,
inference(pre_uni,[status(thm)],[86:[bind(A,$thf( ^ [C: a > a > a] : ( sk4 @ ^ [D: a] : ^ [E: a] : ( C @ ( C @ D @ ( U @ C @ D @ E ) ) @ E ) ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV162^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_Leo-III %s %d SAT
% 0.10/0.32 % Computer : n020.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri Jun 21 18:19:40 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.98/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/0.96 % [INFO] Parsing done (99ms).
% 1.22/0.96 % [INFO] Running in sequential loop mode.
% 1.65/1.18 % [INFO] nitpick registered as external prover.
% 1.65/1.18 % [INFO] Scanning for conjecture ...
% 1.84/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.84/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.84/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.84/1.26 % [INFO] Type checking passed.
% 1.84/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 ...
% 4.78/2.02 % [INFO] Killing All external provers ...
% 4.78/2.03 % Time passed: 1511ms (effective reasoning time: 1057ms)
% 4.78/2.03 % 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)>
% 4.78/2.03 % Axioms used in derivation (0):
% 4.78/2.03 % No. of inferences in proof: 16
% 4.78/2.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1511 ms resp. 1057 ms w/o parsing
% 4.78/2.07 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.78/2.07 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------