TSTP Solution File: SEV383^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV383^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n023.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 16:00:07 EDT 2024
% Result : Theorem 2.09s 1.42s
% Output : Refutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 0 |; 0 &; 5 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 1 usr; 2 con; 0-0 aty)
% Number of variables : 5 ( 0 ^ 2 !; 3 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(1,conjecture,
? [A: $i > $o] :
~ ( A @ a ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE_FENG_7) ).
thf(2,negated_conjecture,
~ ? [A: $i > $o] :
~ ( A @ a ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $o] :
~ ( A @ a ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ~ ! [A: $i > $o] : ( A @ a ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [A: $i > $o] : ( A @ a ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
$false,
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : $false ))]]) ).
thf(12,plain,
$false,
inference(simp,[status(thm)],[7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV383^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_Leo-III %s %d SAT
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 19:29:10 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.97/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.15/0.97 % [INFO] Parsing done (92ms).
% 1.15/0.97 % [INFO] Running in sequential loop mode.
% 1.53/1.17 % [INFO] nitpick registered as external prover.
% 1.64/1.17 % [INFO] Scanning for conjecture ...
% 1.64/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.64/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.64/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.64/1.24 % [INFO] Type checking passed.
% 1.82/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 ...
% 2.09/1.42 % [INFO] Killing All external provers ...
% 2.09/1.42 % Time passed: 883ms (effective reasoning time: 440ms)
% 2.09/1.42 % 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.09/1.42 % Axioms used in derivation (0):
% 2.09/1.42 % No. of inferences in proof: 7
% 2.09/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 883 ms resp. 440 ms w/o parsing
% 2.26/1.44 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.26/1.44 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------