TSTP Solution File: NUM787^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : NUM787^1 : TPTP v8.1.2. Released v3.7.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 7 10:45:42 EDT 2024
% Result : Theorem 2.35s 1.49s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 30 ( 1 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 80 ( 15 ~; 6 |; 0 &; 52 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(x0_type,type,
x0: rat ).
thf(y0_type,type,
y0: rat ).
thf(less_type,type,
less: rat > rat > $o ).
thf(more_type,type,
more: rat > rat > $o ).
thf(is_type,type,
is: rat > rat > $o ).
thf(5,axiom,
! [A: rat,B: rat] :
( ~ ( is @ A @ B )
=> ( ~ ( more @ A @ B )
=> ( less @ A @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81a) ).
thf(12,plain,
! [A: rat,B: rat] :
( ~ ( is @ A @ B )
=> ( ~ ( more @ A @ B )
=> ( less @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
! [B: rat,A: rat] :
( ( is @ A @ B )
| ( more @ A @ B )
| ( less @ A @ B ) ),
inference(cnf,[status(esa)],[12]) ).
thf(1,conjecture,
( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81f) ).
thf(2,negated_conjecture,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
~ ( is @ x0 @ y0 ),
inference(cnf,[status(esa)],[6]) ).
thf(14,plain,
! [B: rat,A: rat] :
( ( more @ A @ B )
| ( less @ A @ B )
| ( ( is @ A @ B )
!= ( is @ x0 @ y0 ) ) ),
inference(paramod_ordered,[status(thm)],[13,7]) ).
thf(15,plain,
( ( more @ x0 @ y0 )
| ( less @ x0 @ y0 ) ),
inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).
thf(8,plain,
~ ( more @ x0 @ y0 ),
inference(cnf,[status(esa)],[6]) ).
thf(3,axiom,
~ ( less @ x0 @ y0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(9,plain,
~ ( less @ x0 @ y0 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(10,plain,
~ ( less @ x0 @ y0 ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(16,plain,
( $false
| $false ),
inference(rewrite,[status(thm)],[15,8,10]) ).
thf(17,plain,
$false,
inference(simp,[status(thm)],[16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM787^1 : TPTP v8.1.2. Released v3.7.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n028.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:40:54 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.92/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.95 % [INFO] Parsing done (105ms).
% 1.21/0.95 % [INFO] Running in sequential loop mode.
% 1.54/1.15 % [INFO] nitpick registered as external prover.
% 1.54/1.16 % [INFO] Scanning for conjecture ...
% 1.65/1.20 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.65/1.22 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.65/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.85/1.23 % [INFO] Type checking passed.
% 1.85/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.35/1.49 % [INFO] Killing All external provers ...
% 2.35/1.49 % Time passed: 972ms (effective reasoning time: 533ms)
% 2.35/1.49 % 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.35/1.49 % Axioms used in derivation (2): satz81a, n
% 2.35/1.49 % No. of inferences in proof: 15
% 2.35/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 972 ms resp. 533 ms w/o parsing
% 2.35/1.52 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.35/1.52 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------