TSTP Solution File: LCL506+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL506+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n032.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 : Sun May 5 07:46:14 EDT 2024
% Result : Theorem 0.09s 0.30s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 25
% Syntax : Number of formulae : 65 ( 30 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 20 ~; 15 |; 0 &)
% ( 17 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 23 ( 22 usr; 22 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f158,plain,
$false,
inference(avatar_sat_refutation,[],[f102,f107,f112,f117,f122,f127,f132,f137,f142,f147,f151,f155,f157]) ).
fof(f157,plain,
( spl2_10
| ~ spl2_12 ),
inference(avatar_contradiction_clause,[],[f156]) ).
fof(f156,plain,
( $false
| spl2_10
| ~ spl2_12 ),
inference(resolution,[],[f154,f146]) ).
fof(f146,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| spl2_10 ),
inference(avatar_component_clause,[],[f144]) ).
fof(f144,plain,
( spl2_10
<=> is_a_theorem(implies(and(sK0,sK1),sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_10])]) ).
fof(f154,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_12 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f153,plain,
( spl2_12
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_12])]) ).
fof(f155,plain,
( ~ spl2_3
| spl2_12 ),
inference(avatar_split_clause,[],[f94,f153,f109]) ).
fof(f109,plain,
( spl2_3
<=> kn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f94,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f151,plain,
( ~ spl2_2
| spl2_11 ),
inference(avatar_split_clause,[],[f93,f149,f104]) ).
fof(f104,plain,
( spl2_2
<=> kn1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f149,plain,
( spl2_11
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_11])]) ).
fof(f93,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f54]) ).
fof(f54,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/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f147,plain,
( ~ spl2_10
| spl2_1 ),
inference(avatar_split_clause,[],[f92,f99,f144]) ).
fof(f99,plain,
( spl2_1
<=> and_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f92,plain,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0))
=> ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
( and_1
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
=> and_1 ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).
fof(f142,plain,
spl2_9,
inference(avatar_split_clause,[],[f85,f139]) ).
fof(f139,plain,
( spl2_9
<=> op_equiv ),
introduced(avatar_definition,[new_symbols(naming,[spl2_9])]) ).
fof(f85,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_equiv) ).
fof(f137,plain,
spl2_8,
inference(avatar_split_clause,[],[f84,f134]) ).
fof(f134,plain,
( spl2_8
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f84,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f132,plain,
spl2_7,
inference(avatar_split_clause,[],[f83,f129]) ).
fof(f129,plain,
( spl2_7
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f83,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f127,plain,
spl2_6,
inference(avatar_split_clause,[],[f82,f124]) ).
fof(f124,plain,
( spl2_6
<=> modus_ponens ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f82,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f122,plain,
spl2_5,
inference(avatar_split_clause,[],[f81,f119]) ).
fof(f119,plain,
( spl2_5
<=> substitution_of_equivalents ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f81,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f117,plain,
spl2_4,
inference(avatar_split_clause,[],[f80,f114]) ).
fof(f114,plain,
( spl2_4
<=> kn3 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f80,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f112,plain,
spl2_3,
inference(avatar_split_clause,[],[f79,f109]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f107,plain,
spl2_2,
inference(avatar_split_clause,[],[f78,f104]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f102,plain,
~ spl2_1,
inference(avatar_split_clause,[],[f77,f99]) ).
fof(f77,plain,
~ and_1,
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
~ and_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ and_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : LCL506+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.09 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri May 3 14:05:24 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.09/0.28 % (1975)Running in auto input_syntax mode. Trying TPTP
% 0.09/0.29 % (1977)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.09/0.29 % (1982)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.09/0.29 % (1979)WARNING: value z3 for option sas not known
% 0.09/0.29 % (1981)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.09/0.29 % (1984)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.09/0.29 % (1979)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.09/0.29 % (1982)First to succeed.
% 0.09/0.29 % (1984)Also succeeded, but the first one will report.
% 0.09/0.29 TRYING [1]
% 0.09/0.29 TRYING [2]
% 0.09/0.29 % (1982)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1975"
% 0.09/0.29 TRYING [1]
% 0.09/0.30 % (1978)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.09/0.30 TRYING [2]
% 0.09/0.30 % (1982)Refutation found. Thanks to Tanya!
% 0.09/0.30 % SZS status Theorem for theBenchmark
% 0.09/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.30 % (1982)------------------------------
% 0.09/0.30 % (1982)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.09/0.30 % (1982)Termination reason: Refutation
% 0.09/0.30
% 0.09/0.30 % (1982)Memory used [KB]: 895
% 0.09/0.30 % (1982)Time elapsed: 0.003 s
% 0.09/0.30 % (1982)Instructions burned: 4 (million)
% 0.09/0.30 % (1975)Success in time 0.013 s
%------------------------------------------------------------------------------