TSTP Solution File: LCL499+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL499+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 : n007.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:32 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 65 ( 27 unt; 0 def)
% Number of atoms : 116 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 85 ( 34 ~; 29 |; 2 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 66 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f248,plain,
$false,
inference(avatar_sat_refutation,[],[f142,f161,f247]) ).
fof(f247,plain,
spl1_4,
inference(avatar_contradiction_clause,[],[f244]) ).
fof(f244,plain,
( $false
| spl1_4 ),
inference(resolution,[],[f231,f141]) ).
fof(f141,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| spl1_4 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f139,plain,
( spl1_4
<=> is_a_theorem(implies(sK0,and(sK0,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f231,plain,
! [X2] : is_a_theorem(implies(X2,and(X2,X2))),
inference(forward_demodulation,[],[f229,f125]) ).
fof(f125,plain,
! [X0,X1] : implies(X1,X0) = or(not(X1),X0),
inference(subsumption_resolution,[],[f112,f107]) ).
fof(f107,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f112,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X1,X0) = or(not(X1),X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X1,X0) = or(not(X1),X0) ),
inference(ennf_transformation,[],[f63]) ).
fof(f63,plain,
( op_implies_or
=> ! [X0,X1] : implies(X1,X0) = or(not(X1),X0) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X1,X0] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f229,plain,
! [X2] : is_a_theorem(or(not(X2),and(X2,X2))),
inference(resolution,[],[f187,f195]) ).
fof(f195,plain,
! [X2] : is_a_theorem(or(and(X2,X2),not(X2))),
inference(backward_demodulation,[],[f181,f194]) ).
fof(f194,plain,
! [X3,X4,X5] : or(and(X3,X4),X5) = implies(implies(X3,not(X4)),X5),
inference(superposition,[],[f125,f179]) ).
fof(f179,plain,
! [X0,X1] : not(implies(X1,not(X0))) = and(X1,X0),
inference(forward_demodulation,[],[f178,f125]) ).
fof(f178,plain,
! [X0,X1] : and(X1,X0) = not(or(not(X1),not(X0))),
inference(subsumption_resolution,[],[f119,f122]) ).
fof(f122,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f119,plain,
! [X0,X1] :
( ~ op_and
| and(X1,X0) = not(or(not(X1),not(X0))) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( ~ op_and
| ! [X0,X1] : and(X1,X0) = not(or(not(X1),not(X0))) ),
inference(ennf_transformation,[],[f69]) ).
fof(f69,plain,
( op_and
=> ! [X0,X1] : and(X1,X0) = not(or(not(X1),not(X0))) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
( op_and
=> ! [X1,X0] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
fof(f181,plain,
! [X2] : is_a_theorem(implies(implies(X2,not(X2)),not(X2))),
inference(superposition,[],[f176,f125]) ).
fof(f176,plain,
! [X0] : is_a_theorem(implies(or(X0,X0),X0)),
inference(subsumption_resolution,[],[f120,f108]) ).
fof(f108,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
fof(f120,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(ennf_transformation,[],[f74]) ).
fof(f74,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f49]) ).
fof(f49,plain,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
( ! [X3] : is_a_theorem(implies(or(X3,X3),X3))
<=> r1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
fof(f187,plain,
! [X6,X5] :
( ~ is_a_theorem(or(X6,X5))
| is_a_theorem(or(X5,X6)) ),
inference(resolution,[],[f162,f143]) ).
fof(f143,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))),
inference(subsumption_resolution,[],[f102,f106]) ).
fof(f106,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f102,plain,
! [X0,X1] :
( ~ r3
| is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
( ~ r3
| ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f66,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( r3
<=> ! [X4,X3] : is_a_theorem(implies(or(X3,X4),or(X4,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).
fof(f162,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(subsumption_resolution,[],[f99,f109]) ).
fof(f109,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f99,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(X0)
| ~ modus_ponens
| ~ is_a_theorem(implies(X1,X0)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) )
| ~ modus_ponens ),
inference(rectify,[],[f82]) ).
fof(f82,plain,
( ! [X1,X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f81]) ).
fof(f81,plain,
( ! [X1,X0] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f77]) ).
fof(f77,plain,
( modus_ponens
=> ! [X1,X0] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
( ! [X1,X0] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) )
<=> modus_ponens ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f161,plain,
~ spl1_3,
inference(avatar_split_clause,[],[f121,f135]) ).
fof(f135,plain,
( spl1_3
<=> kn1 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f121,plain,
~ kn1,
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
~ kn1,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ kn1,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f142,plain,
( spl1_3
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f117,f139,f135]) ).
fof(f117,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| kn1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| kn1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f86,f95]) ).
fof(f95,plain,
( ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0)))
=> ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
( ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0)))
| kn1 ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
=> kn1 ),
inference(unused_predicate_definition_removal,[],[f61]) ).
fof(f61,plain,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( kn1
<=> ! [X3] : is_a_theorem(implies(X3,and(X3,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL499+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 01:50:00 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.54 % (15817)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (15825)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (15825)First to succeed.
% 0.20/0.55 % (15825)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (15825)------------------------------
% 0.20/0.55 % (15825)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (15825)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (15825)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (15825)Memory used [KB]: 5628
% 0.20/0.55 % (15825)Time elapsed: 0.114 s
% 0.20/0.55 % (15825)Instructions burned: 6 (million)
% 0.20/0.55 % (15825)------------------------------
% 0.20/0.55 % (15825)------------------------------
% 0.20/0.55 % (15806)Success in time 0.194 s
%------------------------------------------------------------------------------