TSTP Solution File: LCL459+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n013.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:48:25 EDT 2022
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 19 unt; 3 typ; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 84 ( 36 ~; 29 |; 3 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 54 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_34,type,
sQ2_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_35,type,
sQ3_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_36,type,
sQ4_eqProxy: ( $real * $real ) > $o ).
fof(f404,plain,
$false,
inference(subsumption_resolution,[],[f239,f304]) ).
fof(f304,plain,
! [X1] : is_a_theorem(implies(X1,and(X1,X1))),
inference(resolution,[],[f268,f247]) ).
fof(f247,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(subsumption_resolution,[],[f190,f193]) ).
fof(f193,plain,
and_3,
inference(literal_reordering,[],[f130]) ).
fof(f130,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f190,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(literal_reordering,[],[f132]) ).
fof(f132,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
( ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0))))
| ~ and_3 ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,plain,
( and_3
=> ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f64,plain,
( and_3
<=> ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
( ! [X1,X0] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
<=> and_3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
fof(f268,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f267,f248]) ).
fof(f248,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f198,f175]) ).
fof(f175,plain,
modus_ponens,
inference(literal_reordering,[],[f133]) ).
fof(f133,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f198,plain,
! [X0,X1] :
( ~ modus_ponens
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(literal_reordering,[],[f128]) ).
fof(f128,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(rectify,[],[f106]) ).
fof(f106,plain,
( ! [X1,X0] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ modus_ponens ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
( ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f91]) ).
fof(f91,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f75]) ).
fof(f75,plain,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f267,plain,
! [X0,X1] : is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))),
inference(subsumption_resolution,[],[f194,f169]) ).
fof(f169,plain,
implies_2,
inference(literal_reordering,[],[f129]) ).
fof(f129,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f194,plain,
! [X0,X1] :
( ~ implies_2
| is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))) ),
inference(literal_reordering,[],[f161]) ).
fof(f161,plain,
! [X0,X1] :
( ~ implies_2
| is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
( ~ implies_2
| ! [X0,X1] : is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))) ),
inference(ennf_transformation,[],[f87]) ).
fof(f87,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,plain,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X1,implies(X1,X0)),implies(X1,X0))) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
( implies_2
<=> ! [X1,X0] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).
fof(f239,plain,
~ is_a_theorem(implies(sK0,and(sK0,sK0))),
inference(subsumption_resolution,[],[f174,f183]) ).
fof(f183,plain,
~ kn1,
inference(literal_reordering,[],[f151]) ).
fof(f151,plain,
~ kn1,
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
~ kn1,
inference(flattening,[],[f54]) ).
fof(f54,negated_conjecture,
~ kn1,
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f174,plain,
( kn1
| ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
inference(literal_reordering,[],[f127]) ).
fof(f127,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| kn1 ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
( kn1
| ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f109,f114]) ).
fof(f114,plain,
( ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0)))
=> ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( kn1
| ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f76]) ).
fof(f76,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
=> kn1 ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
<=> kn1 ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( ! [X3] : is_a_theorem(implies(X3,and(X3,X3)))
<=> kn1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.34 % Computer : n013.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Tue Aug 30 01:59:17 EDT 2022
% 0.10/0.34 % CPUTime :
% 0.15/0.44 % (28561)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.15/0.46 % (28561)First to succeed.
% 0.15/0.46 % (28569)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.15/0.47 % (28569)Also succeeded, but the first one will report.
% 0.15/0.47 % (28561)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (28561)------------------------------
% 0.15/0.47 % (28561)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47 % (28561)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47 % (28561)Termination reason: Refutation
% 0.15/0.47
% 0.15/0.47 % (28561)Memory used [KB]: 6012
% 0.15/0.47 % (28561)Time elapsed: 0.015 s
% 0.15/0.47 % (28561)Instructions burned: 15 (million)
% 0.15/0.47 % (28561)------------------------------
% 0.15/0.47 % (28561)------------------------------
% 0.15/0.47 % (28546)Success in time 0.124 s
%------------------------------------------------------------------------------