TSTP Solution File: LCL512+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL512+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 : n011.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:35 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 12 unt; 0 def)
% Number of atoms : 80 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 60 ( 24 ~; 23 |; 0 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f230,plain,
$false,
inference(avatar_sat_refutation,[],[f120,f136,f161,f177,f186,f190,f229]) ).
fof(f229,plain,
( spl2_4
| ~ spl2_7
| ~ spl2_18 ),
inference(avatar_contradiction_clause,[],[f226]) ).
fof(f226,plain,
( $false
| spl2_4
| ~ spl2_7
| ~ spl2_18 ),
inference(resolution,[],[f223,f119]) ).
fof(f119,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| spl2_4 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f117,plain,
( spl2_4
<=> is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f223,plain,
( ! [X4,X5] : is_a_theorem(implies(equiv(X4,X5),implies(X4,X5)))
| ~ spl2_7
| ~ spl2_18 ),
inference(superposition,[],[f131,f176]) ).
fof(f176,plain,
( ! [X0,X1] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0)
| ~ spl2_18 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f175,plain,
( spl2_18
<=> ! [X0,X1] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_18])]) ).
fof(f131,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1))
| ~ spl2_7 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f130,plain,
( spl2_7
<=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f190,plain,
spl2_17,
inference(avatar_contradiction_clause,[],[f189]) ).
fof(f189,plain,
( $false
| spl2_17 ),
inference(resolution,[],[f173,f103]) ).
fof(f103,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f173,plain,
( ~ op_equiv
| spl2_17 ),
inference(avatar_component_clause,[],[f171]) ).
fof(f171,plain,
( spl2_17
<=> op_equiv ),
introduced(avatar_definition,[new_symbols(naming,[spl2_17])]) ).
fof(f186,plain,
spl2_8,
inference(avatar_contradiction_clause,[],[f185]) ).
fof(f185,plain,
( $false
| spl2_8 ),
inference(resolution,[],[f135,f86]) ).
fof(f86,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f135,plain,
( ~ kn2
| spl2_8 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f133,plain,
( spl2_8
<=> kn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f177,plain,
( ~ spl2_17
| spl2_18 ),
inference(avatar_split_clause,[],[f93,f175,f171]) ).
fof(f93,plain,
! [X0,X1] :
( and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0)
| ~ op_equiv ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
( ! [X0,X1] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0)
| ~ op_equiv ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( op_equiv
=> ! [X0,X1] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0) ),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
( op_equiv
=> ! [X1,X0] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f161,plain,
~ spl2_3,
inference(avatar_split_clause,[],[f87,f113]) ).
fof(f113,plain,
( spl2_3
<=> equivalence_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f87,plain,
~ equivalence_1,
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
~ equivalence_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(f136,plain,
( spl2_7
| ~ spl2_8 ),
inference(avatar_split_clause,[],[f99,f133,f130]) ).
fof(f99,plain,
! [X0,X1] :
( ~ kn2
| is_a_theorem(implies(and(X1,X0),X1)) ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
| ~ kn2 ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
( kn2
=> ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(unused_predicate_definition_removal,[],[f51]) ).
fof(f51,plain,
( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
<=> kn2 ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
( ! [X4,X3] : is_a_theorem(implies(and(X3,X4),X3))
<=> kn2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f120,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f90,f117,f113]) ).
fof(f90,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| equivalence_1 ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
( equivalence_1
| ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/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.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 02:03:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 % (28357)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.46 % (28373)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.46 % (28357)First to succeed.
% 0.20/0.46 % (28357)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.46 % (28357)------------------------------
% 0.20/0.46 % (28357)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.46 % (28357)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.46 % (28357)Termination reason: Refutation
% 0.20/0.46
% 0.20/0.46 % (28357)Memory used [KB]: 5500
% 0.20/0.46 % (28357)Time elapsed: 0.075 s
% 0.20/0.46 % (28357)Instructions burned: 4 (million)
% 0.20/0.46 % (28357)------------------------------
% 0.20/0.46 % (28357)------------------------------
% 0.20/0.46 % (28353)Success in time 0.104 s
%------------------------------------------------------------------------------