TSTP Solution File: NUM298+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n025.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 : Wed Aug 31 17:58:03 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 48 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 24 ~; 15 |; 8 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 34 ( 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f435,plain,
$false,
inference(unit_resulting_resolution,[],[f423,f424,f432,f425]) ).
fof(f425,plain,
! [X2,X3,X0,X1] :
( ~ rdn_translate(X3,rdn_neg(X2))
| less(X3,X1)
| ~ rdn_translate(X1,rdn_pos(X0)) ),
inference(cnf_transformation,[],[f420]) ).
fof(f420,plain,
! [X0,X1,X2,X3] :
( ~ rdn_translate(X3,rdn_neg(X2))
| less(X3,X1)
| ~ rdn_translate(X1,rdn_pos(X0)) ),
inference(rectify,[],[f419]) ).
fof(f419,plain,
! [X2,X1,X0,X3] :
( ~ rdn_translate(X3,rdn_neg(X0))
| less(X3,X1)
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(flattening,[],[f418]) ).
fof(f418,plain,
! [X3,X1,X0,X2] :
( less(X3,X1)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_neg(X0)) ),
inference(ennf_transformation,[],[f405]) ).
fof(f405,plain,
! [X3,X1,X0,X2] :
( ( rdn_translate(X1,rdn_pos(X2))
& rdn_translate(X3,rdn_neg(X0)) )
=> less(X3,X1) ),
inference(rectify,[],[f282]) ).
fof(f282,axiom,
! [X9,X1,X10,X0] :
( ( rdn_translate(X0,rdn_neg(X9))
& rdn_translate(X1,rdn_pos(X10)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_pos) ).
fof(f432,plain,
~ less(nn2,n2),
inference(unit_resulting_resolution,[],[f426,f428]) ).
fof(f428,plain,
! [X0,X1] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f422]) ).
fof(f422,plain,
! [X0,X1] :
( ( ( X0 != X1
& ~ less(X0,X1) )
| ~ less(X1,X0) )
& ( less(X1,X0)
| X0 = X1
| less(X0,X1) ) ),
inference(flattening,[],[f421]) ).
fof(f421,plain,
! [X0,X1] :
( ( ( X0 != X1
& ~ less(X0,X1) )
| ~ less(X1,X0) )
& ( less(X1,X0)
| X0 = X1
| less(X0,X1) ) ),
inference(nnf_transformation,[],[f406]) ).
fof(f406,plain,
! [X0,X1] :
( ( X0 != X1
& ~ less(X0,X1) )
<=> less(X1,X0) ),
inference(rectify,[],[f284]) ).
fof(f284,axiom,
! [X1,X0] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f426,plain,
less(n2,nn2),
inference(cnf_transformation,[],[f404]) ).
fof(f404,plain,
less(n2,nn2),
inference(flattening,[],[f403]) ).
fof(f403,negated_conjecture,
~ ~ less(n2,nn2),
inference(negated_conjecture,[],[f402]) ).
fof(f402,conjecture,
~ less(n2,nn2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_not_less_nn2) ).
fof(f424,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn2) ).
fof(f423,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 06:29:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.49 % (1761)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (1761)First to succeed.
% 0.21/0.51 % (1773)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51 % (1760)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51 % (1769)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51 % (1761)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (1761)------------------------------
% 0.21/0.51 % (1761)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (1761)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (1761)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (1761)Memory used [KB]: 6268
% 0.21/0.51 % (1761)Time elapsed: 0.091 s
% 0.21/0.51 % (1761)Instructions burned: 3 (million)
% 0.21/0.51 % (1761)------------------------------
% 0.21/0.51 % (1761)------------------------------
% 0.21/0.51 % (1743)Success in time 0.163 s
%------------------------------------------------------------------------------