TSTP Solution File: SEV169^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV169^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 21 04:11:03 EDT 2024
% Result : Theorem 3.44s 2.10s
% Output : Refutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 15 unt; 3 typ; 0 def)
% Number of atoms : 34 ( 33 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 126 ( 12 ~; 2 |; 9 &; 100 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 146 ( 140 ^ 6 !; 0 ?; 146 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: ( a > a > a ) > a ).
thf(sk2_type,type,
sk2: ( a > a > a ) > a ).
thf(1,conjecture,
! [A: ( a > a > a ) > a,B: ( a > a > a ) > a] :
( ( ( A
= ( ^ [C: a > a > a] :
( C
@ ( A
@ ^ [D: a,E: a] : D )
@ ( A
@ ^ [D: a,E: a] : E ) ) ) )
& ( B
= ( ^ [C: a > a > a] :
( C
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E ) ) ) )
& ( ( A
@ ^ [C: a,D: a] : C )
= ( B
@ ^ [C: a,D: a] : C ) )
& ( ( A
@ ^ [C: a,D: a] : D )
= ( B
@ ^ [C: a,D: a] : D ) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM188_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( a > a > a ) > a,B: ( a > a > a ) > a] :
( ( ( A
= ( ^ [C: a > a > a] :
( C
@ ( A
@ ^ [D: a,E: a] : D )
@ ( A
@ ^ [D: a,E: a] : E ) ) ) )
& ( B
= ( ^ [C: a > a > a] :
( C
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E ) ) ) )
& ( ( A
@ ^ [C: a,D: a] : C )
= ( B
@ ^ [C: a,D: a] : C ) )
& ( ( A
@ ^ [C: a,D: a] : D )
= ( B
@ ^ [C: a,D: a] : D ) ) )
=> ( A = B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: ( a > a > a ) > a,B: ( a > a > a ) > a] :
( ( ( A
= ( ^ [C: a > a > a] :
( C
@ ( A
@ ^ [D: a,E: a] : D )
@ ( A
@ ^ [D: a,E: a] : E ) ) ) )
& ( B
= ( ^ [C: a > a > a] :
( C
@ ( B
@ ^ [D: a,E: a] : D )
@ ( B
@ ^ [D: a,E: a] : E ) ) ) )
& ( ( A
@ ^ [C: a,D: a] : C )
= ( B
@ ^ [C: a,D: a] : C ) )
& ( ( A
@ ^ [C: a,D: a] : D )
= ( B
@ ^ [C: a,D: a] : D ) ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( sk1
= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
( sk1
= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( sk2
= ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
( sk2
= ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(5,plain,
sk1 != sk2,
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[5]) ).
thf(17,plain,
( ( ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) )
!= sk1 )
| ( sk2 != sk2 ) ),
inference(paramod_ordered,[status(thm)],[11,9]) ).
thf(18,plain,
( ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) )
!= sk1 ),
inference(pattern_uni,[status(thm)],[17:[]]) ).
thf(22,plain,
( ( ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) )
!= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) )
| ( sk1 != sk1 ) ),
inference(paramod_ordered,[status(thm)],[13,18]) ).
thf(23,plain,
( ( ^ [A: a > a > a] :
( A
@ ( sk2
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) )
!= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) ),
inference(pattern_uni,[status(thm)],[22:[]]) ).
thf(6,plain,
( ( sk1
@ ^ [A: a,B: a] : A )
= ( sk2
@ ^ [A: a,B: a] : A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
( ( sk2
@ ^ [A: a,B: a] : A )
= ( sk1
@ ^ [A: a,B: a] : A ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(35,plain,
( ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk2
@ ^ [B: a,C: a] : C ) ) )
!= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) ),
inference(rewrite,[status(thm)],[23,10]) ).
thf(8,plain,
( ( sk1
@ ^ [A: a,B: a] : B )
= ( sk2
@ ^ [A: a,B: a] : B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
( ( sk2
@ ^ [A: a,B: a] : B )
= ( sk1
@ ^ [A: a,B: a] : B ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(51,plain,
( ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) )
!= ( ^ [A: a > a > a] :
( A
@ ( sk1
@ ^ [B: a,C: a] : B )
@ ( sk1
@ ^ [B: a,C: a] : C ) ) ) ),
inference(rewrite,[status(thm)],[35,12]) ).
thf(52,plain,
$false,
inference(simp,[status(thm)],[51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV169^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 18:29:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.92/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/1.04 % [INFO] Parsing done (129ms).
% 1.22/1.05 % [INFO] Running in sequential loop mode.
% 1.59/1.30 % [INFO] nitpick registered as external prover.
% 1.59/1.31 % [INFO] Scanning for conjecture ...
% 1.86/1.38 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.86/1.40 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.86/1.40 % [INFO] Problem is higher-order (TPTP THF).
% 1.86/1.41 % [INFO] Type checking passed.
% 1.86/1.41 % [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.14/2.04 % [INFO] Killing All external provers ...
% 3.44/2.10 % Time passed: 1529ms (effective reasoning time: 980ms)
% 3.44/2.10 % 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.44/2.10 % Axioms used in derivation (0):
% 3.44/2.10 % No. of inferences in proof: 20
% 3.44/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1529 ms resp. 980 ms w/o parsing
% 3.66/2.16 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.66/2.16 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------