TSTP Solution File: MSC012+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.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 : Fri May 19 11:35:48 EDT 2023
% Result : Theorem 2.51s 1.63s
% Output : Refutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 15 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 26 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 2 ~; 2 |; 8 &; 32 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 14 !; 4 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(goal_type,type,
goal: $o ).
thf(p_type,type,
p: $i > $o ).
thf(less_type,type,
less: $i > $i > $o ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( less @ A @ B )
& ( less @ B @ C ) )
=> ( less @ A @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_less) ).
thf(14,plain,
! [A: $i,B: $i,C: $i] :
( ( ( less @ A @ B )
& ( less @ B @ C ) )
=> ( less @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
thf(2,negated_conjecture,
~ goal,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ goal,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,axiom,
! [A: $i] :
? [B: $i] : ( less @ A @ B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).
thf(16,plain,
! [A: $i] :
? [B: $i] : ( less @ A @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i] :
( ( p @ A )
| ? [B: $i] :
( ( less @ A @ B )
& ( p @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).
thf(11,plain,
! [A: $i] :
( ( p @ A )
| ? [B: $i] :
( ( less @ A @ B )
& ( p @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( ( p @ A )
& ( less @ A @ B )
& ( p @ B ) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).
thf(8,plain,
! [A: $i,B: $i] :
( ( ( p @ A )
& ( less @ A @ B )
& ( p @ B ) )
=> goal ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(18,plain,
$false,
inference(e,[status(thm)],[14,7,16,11,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu May 18 15:25:13 EDT 2023
% 0.16/0.38 % CPUTime :
% 1.01/0.89 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.09/1.00 % [INFO] Parsing done (115ms).
% 1.09/1.01 % [INFO] Running in sequential loop mode.
% 1.67/1.23 % [INFO] eprover registered as external prover.
% 1.67/1.23 % [INFO] cvc4 registered as external prover.
% 1.67/1.23 % [INFO] Scanning for conjecture ...
% 1.77/1.27 % [INFO] Found a conjecture and 4 axioms. Running axiom selection ...
% 1.77/1.29 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.77/1.31 % [INFO] Problem is first-order (TPTP FOF).
% 1.77/1.31 % [INFO] Type checking passed.
% 1.77/1.32 % [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.51/1.63 % External prover 'e' found a proof!
% 2.51/1.63 % [INFO] Killing All external provers ...
% 2.51/1.63 % Time passed: 1081ms (effective reasoning time: 612ms)
% 2.51/1.63 % 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.51/1.63 % Axioms used in derivation (4): transitive_less, serial_less, right_to_left, left_to_right
% 2.51/1.63 % No. of inferences in proof: 12
% 2.51/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1081 ms resp. 612 ms w/o parsing
% 2.89/1.66 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.89/1.66 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------