TSTP Solution File: SEV290^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n032.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:56 EDT 2024
% Result : Theorem 2.11s 1.44s
% Output : Refutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 1 def)
% Number of atoms : 12 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 35 ( 3 ~; 0 |; 4 &; 21 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 4 ^ 8 !; 4 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(c0_type,type,
c0: ( $i > $o ) > $o ).
thf(c_less__eq__type,type,
c_less__eq_: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(c_less__eq__def,definition,
( c_less__eq_
= ( ^ [A: ( $i > $o ) > $o,B: ( $i > $o ) > $o] :
! [C: ( ( $i > $o ) > $o ) > $o] :
( ( ( C @ A )
& ! [D: ( $i > $o ) > $o] :
( ( C @ D )
=> ( C @ ( cSUCC @ D ) ) ) )
=> ( C @ B ) ) ) ) ).
thf(1,conjecture,
? [A: ( ( $i > $o ) > $o ) > $o] :
! [B: ( $i > $o ) > $o] :
( ( A @ B )
=> ( c_less__eq_ @ B @ c0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE1) ).
thf(2,negated_conjecture,
~ ? [A: ( ( $i > $o ) > $o ) > $o] :
! [B: ( $i > $o ) > $o] :
( ( A @ B )
=> ( c_less__eq_ @ B @ c0 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: ( ( $i > $o ) > $o ) > $o] :
! [B: ( $i > $o ) > $o] :
( ( A @ B )
=> ! [C: ( ( $i > $o ) > $o ) > $o] :
( ( ( C @ B )
& ! [D: ( $i > $o ) > $o] :
( ( C @ D )
=> ( C
@ ^ [E: $i > $o] :
? [F: $i] :
( ( E @ F )
& ( D
@ ^ [G: $i] :
( ( G != F )
& ( E @ G ) ) ) ) ) ) )
=> ( C @ c0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
! [A: ( ( $i > $o ) > $o ) > $o] : ( A @ ( sk1 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
$false,
inference(prim_subst,[status(thm)],[7:[bind(A,$thf( ^ [B: ( $i > $o ) > $o] : $false ))]]) ).
thf(20,plain,
$false,
inference(simp,[status(thm)],[11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.00/0.09 % Command : run_Leo-III %s %d SAT
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Fri Jun 21 18:15:10 EDT 2024
% 0.09/0.27 % CPUTime :
% 0.71/0.71 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.87/0.81 % [INFO] Parsing done (99ms).
% 0.87/0.82 % [INFO] Running in sequential loop mode.
% 1.25/1.03 % [INFO] nitpick registered as external prover.
% 1.25/1.04 % [INFO] Scanning for conjecture ...
% 1.43/1.10 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.43/1.11 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.43/1.12 % [INFO] Problem is higher-order (TPTP THF).
% 1.43/1.12 % [INFO] Type checking passed.
% 1.43/1.12 % [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 ...
% 2.11/1.40 % [INFO] Killing All external provers ...
% 2.11/1.44 % Time passed: 1006ms (effective reasoning time: 581ms)
% 2.11/1.44 % 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)>
% 2.11/1.44 % Axioms used in derivation (0):
% 2.11/1.44 % No. of inferences in proof: 6
% 2.11/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1006 ms resp. 581 ms w/o parsing
% 2.32/1.46 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.32/1.46 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------