TSTP Solution File: SEU864^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU864^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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 03:44:06 EDT 2024
% Result : Theorem 3.23s 1.81s
% Output : Refutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 2 unt; 3 typ; 0 def)
% Number of atoms : 49 ( 28 equ; 8 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 96 ( 15 ~; 18 |; 3 &; 51 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 15 ^ 17 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(t_type,type,
t: a ).
thf(sk1_type,type,
sk1: ( a > $o ) > $o ).
thf(1,conjecture,
! [A: ( a > $o ) > $o] :
( ( ( A
@ ^ [B: a] : $false )
& ! [B: a > $o] :
( ( A @ B )
=> ! [C: a] :
( ( t = C )
=> ( A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) ) ) ) )
=> ( A @ ( (=) @ a @ t ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDOMLEMMA1_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( a > $o ) > $o] :
( ( ( A
@ ^ [B: a] : $false )
& ! [B: a > $o] :
( ( A @ B )
=> ! [C: a] :
( ( t = C )
=> ( A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) ) ) ) )
=> ( A @ ( (=) @ a @ t ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: ( a > $o ) > $o] :
( ( ( A
@ ^ [B: a] : $false )
& ! [B: a > $o] :
( ( A @ B )
=> ! [C: a] :
( ( t = C )
=> ( A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) ) ) ) )
=> ( A @ ( (=) @ a @ t ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( sk1
@ ^ [A: a] : $false ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [B: a,A: a > $o] :
( ~ ( sk1 @ A )
| ( t != B )
| ( sk1
@ ^ [C: a] :
( ( A @ C )
| ( B = C ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: a,A: a > $o] :
( ( t != B )
| ~ ( sk1 @ A )
| ( sk1
@ ^ [C: a] :
( ( A @ C )
| ( B = C ) ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(8,plain,
! [A: a > $o] :
( ~ ( sk1 @ A )
| ( sk1
@ ^ [B: a] :
( ( A @ B )
| ( t = B ) ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(4,plain,
~ ( sk1 @ ( (=) @ a @ t ) ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [A: a > $o] :
( ~ ( sk1 @ A )
| ( ( sk1
@ ^ [B: a] :
( ( A @ B )
| ( t = B ) ) )
!= ( sk1 @ ( (=) @ a @ t ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,4]) ).
thf(18,plain,
! [A: a > $o] :
( ~ ( sk1 @ A )
| ( ( ^ [B: a] :
( ( A @ B )
| ( t = B ) ) )
!= ( (=) @ a @ t ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(22,plain,
! [A: a > $o] :
( ( ( ^ [B: a] :
( ( A @ B )
| ( t = B ) ) )
!= ( (=) @ a @ t ) )
| ( ( sk1
@ ^ [B: a] : $false )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[6,18]) ).
thf(23,plain,
( ( ^ [A: a] :
( $false
| ( t = A ) ) )
!= ( (=) @ a @ t ) ),
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( ^ [B: a] : $false ))]]) ).
thf(26,plain,
$false,
inference(simp,[status(thm)],[23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU864^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n025.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 15:46:39 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.92/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.96 % [INFO] Parsing done (106ms).
% 1.20/0.96 % [INFO] Running in sequential loop mode.
% 1.62/1.22 % [INFO] nitpick registered as external prover.
% 1.62/1.22 % [INFO] Scanning for conjecture ...
% 1.87/1.28 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.87/1.30 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.87/1.30 % [INFO] Problem is higher-order (TPTP THF).
% 1.87/1.30 % [INFO] Type checking passed.
% 1.87/1.31 % [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.23/1.81 % [INFO] Killing All external provers ...
% 3.23/1.81 % Time passed: 1264ms (effective reasoning time: 839ms)
% 3.23/1.81 % 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.23/1.81 % Axioms used in derivation (0):
% 3.23/1.81 % No. of inferences in proof: 13
% 3.23/1.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1264 ms resp. 839 ms w/o parsing
% 3.29/1.86 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.29/1.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------