TSTP Solution File: SEV164^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV164^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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 : Tue May 21 04:11:02 EDT 2024
% Result : Theorem 3.98s 1.86s
% Output : Refutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 33 ( 8 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 112 ( 15 ~; 7 |; 0 &; 90 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 98 ( 64 ^ 13 !; 21 ?; 98 :)
% 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/sandbox2/benchmark/theBenchmark.p',cTHM185_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,
( ( sk1
@ ( sk4
@ ^ [A: a,B: a] : A )
@ ( sk4
@ ^ [A: a,B: a] : B ) )
| ( sk1 @ sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[7]) ).
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,
! [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)],[6]) ).
thf(19,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)],[8]) ).
thf(24,plain,
! [A: ( a > a > a ) > a] :
~ ( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ),
inference(pre_uni,[status(thm)],[19:[bind(A,$thf( C @ ^ [D: a] : ^ [E: a] : D )),bind(B,$thf( C @ ^ [D: a] : ^ [E: a] : E ))]]) ).
thf(26,plain,
! [A: ( a > a > a ) > a] :
~ ( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ),
inference(simp,[status(thm)],[24]) ).
thf(27,plain,
! [A: ( a > a > a ) > a] :
( ( sk1 @ sk2 @ sk3 )
| ( ( 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 ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,26]) ).
thf(28,plain,
sk1 @ sk2 @ sk3,
inference(pre_uni,[status(thm)],[27:[bind(A,$thf( sk4 ))]]) ).
thf(49,plain,
! [A: ( a > a > a ) > a] :
( ( sk1 @ sk2 @ sk3 )
!= ( sk1
@ ( A
@ ^ [B: a,C: a] : B )
@ ( A
@ ^ [B: a,C: a] : C ) ) ),
inference(paramod_ordered,[status(thm)],[28,26]) ).
thf(56,plain,
$false,
inference(pre_uni,[status(thm)],[49:[bind(A,$thf( ^ [C: a > a > a] : ( C @ ( C @ sk2 @ ( E @ C ) ) @ sk3 ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV164^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n017.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 19:19:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.93/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (97ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.56/1.16 % [INFO] nitpick registered as external prover.
% 1.56/1.16 % [INFO] Scanning for conjecture ...
% 1.67/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.67/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.67/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.67/1.23 % [INFO] Type checking passed.
% 1.81/1.24 % [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 ...
% 3.98/1.85 % [INFO] Killing All external provers ...
% 3.98/1.86 % Time passed: 1333ms (effective reasoning time: 894ms)
% 3.98/1.86 % 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)>
% 3.98/1.86 % Axioms used in derivation (0):
% 3.98/1.86 % No. of inferences in proof: 16
% 3.98/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1333 ms resp. 894 ms w/o parsing
% 3.98/1.90 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.98/1.90 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------