TSTP Solution File: SEU894^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU894^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n028.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:40:23 EDT 2024
% Result : Theorem 2.72s 1.79s
% Output : Refutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 50 ( 2 ~; 0 |; 9 &; 27 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 3 ^ 12 !; 9 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(1,conjecture,
! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM15_0_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(22,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU894^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n028.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Sun May 19 17:50:09 EDT 2024
% 0.16/0.36 % CPUTime :
% 1.02/0.95 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.13/1.06 % [INFO] Parsing done (114ms).
% 1.32/1.07 % [INFO] Running in sequential loop mode.
% 1.65/1.31 % [INFO] eprover registered as external prover.
% 1.65/1.31 % [INFO] cvc4 registered as external prover.
% 1.65/1.32 % [INFO] Scanning for conjecture ...
% 1.89/1.37 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.89/1.39 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.89/1.39 % [INFO] Problem is higher-order (TPTP THF).
% 1.89/1.40 % [INFO] Type checking passed.
% 1.89/1.40 % [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.72/1.79 % External prover 'e' found a proof!
% 2.72/1.79 % [INFO] Killing All external provers ...
% 2.72/1.79 % Time passed: 1260ms (effective reasoning time: 712ms)
% 2.72/1.79 % 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.72/1.79 % Axioms used in derivation (0):
% 2.72/1.79 % No. of inferences in proof: 4
% 2.72/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1260 ms resp. 712 ms w/o parsing
% 2.72/1.81 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.72/1.81 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------