TSTP Solution File: NUM788^1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : NUM788^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n019.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 01:32:00 EDT 2024
% Result : Theorem 3.17s 1.79s
% Output : Refutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 16 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 22 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 22 ~; 0 |; 0 &; 40 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(x0_type,type,
x0: rat ).
thf(y0_type,type,
y0: rat ).
thf(more_type,type,
more: rat > rat > $o ).
thf(less_type,type,
less: rat > rat > $o ).
thf(is_type,type,
is: rat > rat > $o ).
thf(1,conjecture,
~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81g) ).
thf(2,negated_conjecture,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(9,plain,
more @ x0 @ y0,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $o] :
( ~ ~ A
=> A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',et) ).
thf(10,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: rat,B: rat] :
~ ( ( ( is @ A @ B )
=> ~ ( more @ A @ B ) )
=> ~ ~ ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ~ ( is @ A @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81b) ).
thf(11,plain,
! [A: rat,B: rat] :
~ ( ( ( is @ A @ B )
=> ~ ( more @ A @ B ) )
=> ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ~ ( is @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(22,plain,
$false,
inference(cvc4,[status(thm)],[6,9,10,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM788^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n019.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 : Mon May 20 05:50:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.03/0.92 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.32/1.04 % [INFO] Parsing done (120ms).
% 1.32/1.04 % [INFO] Running in sequential loop mode.
% 1.70/1.28 % [INFO] eprover registered as external prover.
% 1.70/1.28 % [INFO] cvc4 registered as external prover.
% 1.70/1.29 % [INFO] Scanning for conjecture ...
% 1.95/1.34 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 1.95/1.36 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.95/1.38 % [INFO] Problem is higher-order (TPTP THF).
% 1.95/1.38 % [INFO] Type checking passed.
% 1.95/1.38 % [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.94/1.78 % External prover 'cvc4' found a proof!
% 2.94/1.78 % [INFO] Killing All external provers ...
% 3.17/1.78 % Time passed: 1257ms (effective reasoning time: 736ms)
% 3.17/1.78 % 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.17/1.79 % Axioms used in derivation (3): m, et, satz81b
% 3.17/1.79 % No. of inferences in proof: 10
% 3.17/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1257 ms resp. 736 ms w/o parsing
% 3.20/1.81 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.20/1.81 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------