TSTP Solution File: NUM783^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : NUM783^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n027.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 7 10:45:40 EDT 2024
% Result : Theorem 2.48s 1.56s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 2 unt; 8 typ; 0 def)
% Number of atoms : 42 ( 0 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 102 ( 9 ~; 0 |; 0 &; 90 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(x0_type,type,
x0: rat ).
thf(y0_type,type,
y0: rat ).
thf(or3_type,type,
or3: $o > $o > $o > $o ).
thf(is_type,type,
is: rat > rat > $o ).
thf(more_type,type,
more: rat > rat > $o ).
thf(less_type,type,
less: rat > rat > $o ).
thf(ec3_type,type,
ec3: $o > $o > $o > $o ).
thf(1,conjecture,
or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).
thf(2,negated_conjecture,
~ ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,axiom,
! [A: rat,B: rat] :
~ ( ( or3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) )
=> ~ ( ec3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81) ).
thf(7,plain,
! [A: rat,B: rat] :
~ ( ( or3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) )
=> ~ ( ec3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,plain,
~ ( ! [A: rat,B: rat] : ( or3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) )
=> ~ ! [A: rat,B: rat] : ( ec3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) ) ),
inference(miniscope,[status(thm)],[7]) ).
thf(10,plain,
! [B: rat,A: rat] : ( or3 @ ( is @ A @ B ) @ ( more @ A @ B ) @ ( less @ A @ B ) ),
inference(cnf,[status(esa)],[8]) ).
thf(12,plain,
~ $true,
inference(rewrite,[status(thm)],[5,10]) ).
thf(13,plain,
$false,
inference(simp,[status(thm)],[12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM783^1 : TPTP v8.1.2. Released v3.7.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 6 19:27:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.03/0.89 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.28/1.02 % [INFO] Parsing done (129ms).
% 1.28/1.03 % [INFO] Running in sequential loop mode.
% 1.65/1.24 % [INFO] nitpick registered as external prover.
% 1.65/1.24 % [INFO] Scanning for conjecture ...
% 1.74/1.29 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.74/1.31 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.74/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.74/1.32 % [INFO] Type checking passed.
% 1.74/1.33 % [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.48/1.55 % [INFO] Killing All external provers ...
% 2.48/1.56 % Time passed: 1028ms (effective reasoning time: 519ms)
% 2.48/1.56 % 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.48/1.56 % Axioms used in derivation (1): satz81
% 2.48/1.56 % No. of inferences in proof: 9
% 2.48/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1028 ms resp. 519 ms w/o parsing
% 2.48/1.58 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.48/1.58 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------