TSTP Solution File: LCL469+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL469+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 : n010.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:27 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 103 ( 13 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 84 ( 36 ~; 31 |; 0 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 46 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f255,plain,
$false,
inference(avatar_sat_refutation,[],[f139,f166,f175,f183,f184,f193,f194,f199,f254]) ).
fof(f254,plain,
( ~ spl2_5
| ~ spl2_11
| spl2_13
| ~ spl2_16 ),
inference(avatar_contradiction_clause,[],[f251]) ).
fof(f251,plain,
( $false
| ~ spl2_5
| ~ spl2_11
| spl2_13
| ~ spl2_16 ),
inference(subsumption_resolution,[],[f170,f246]) ).
fof(f246,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ spl2_5
| ~ spl2_11
| ~ spl2_16 ),
inference(backward_demodulation,[],[f134,f232]) ).
fof(f232,plain,
( ! [X2,X3] : or(X2,X3) = implies(not(X2),X3)
| ~ spl2_11
| ~ spl2_16 ),
inference(superposition,[],[f182,f161]) ).
fof(f161,plain,
( ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0)))
| ~ spl2_11 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f160,plain,
( spl2_11
<=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_11])]) ).
fof(f182,plain,
( ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0)))
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f181,plain,
( spl2_16
<=> ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_16])]) ).
fof(f134,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f133,plain,
( spl2_5
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f170,plain,
( ~ is_a_theorem(implies(sK1,or(sK1,sK0)))
| spl2_13 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f168,plain,
( spl2_13
<=> is_a_theorem(implies(sK1,or(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_13])]) ).
fof(f199,plain,
spl2_15,
inference(avatar_split_clause,[],[f113,f177]) ).
fof(f177,plain,
( spl2_15
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_15])]) ).
fof(f113,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f194,plain,
spl2_12,
inference(avatar_split_clause,[],[f96,f163]) ).
fof(f163,plain,
( spl2_12
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_12])]) ).
fof(f96,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f193,plain,
~ spl2_14,
inference(avatar_split_clause,[],[f104,f172]) ).
fof(f172,plain,
( spl2_14
<=> or_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_14])]) ).
fof(f104,plain,
~ or_1,
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
~ or_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ or_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f184,plain,
spl2_6,
inference(avatar_split_clause,[],[f99,f136]) ).
fof(f136,plain,
( spl2_6
<=> cn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f99,plain,
cn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f183,plain,
( ~ spl2_15
| spl2_16 ),
inference(avatar_split_clause,[],[f107,f181,f177]) ).
fof(f107,plain,
! [X0,X1] :
( or(X1,X0) = not(and(not(X1),not(X0)))
| ~ op_or ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0)))
| ~ op_or ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
( ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f175,plain,
( ~ spl2_13
| spl2_14 ),
inference(avatar_split_clause,[],[f115,f172,f168]) ).
fof(f115,plain,
( or_1
| ~ is_a_theorem(implies(sK1,or(sK1,sK0))) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
( or_1
| ~ is_a_theorem(implies(sK1,or(sK1,sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f93,f94]) ).
fof(f94,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X1,X0)))
=> ~ is_a_theorem(implies(sK1,or(sK1,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
( or_1
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X1,X0))) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
( or_1
| ? [X1,X0] : ~ is_a_theorem(implies(X0,or(X0,X1))) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
=> or_1 ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
<=> or_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_1) ).
fof(f166,plain,
( spl2_11
| ~ spl2_12 ),
inference(avatar_split_clause,[],[f102,f163,f160]) ).
fof(f102,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X1,X0) = not(and(X1,not(X0))) ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
( ~ op_implies_and
| ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
( op_implies_and
=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(rectify,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X1,X0] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f139,plain,
( spl2_5
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f97,f136,f133]) ).
fof(f97,plain,
! [X0,X1] :
( ~ cn2
| is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
( cn2
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f45,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
<=> cn2 ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL469+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 01:56:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.51 % (21884)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.51 % (21881)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.51 % (21866)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.51 % (21877)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (21866)First to succeed.
% 0.19/0.52 % (21864)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.19/0.52 % (21871)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (21864)Also succeeded, but the first one will report.
% 0.19/0.52 % (21873)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.52 % (21870)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (21863)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.52 % (21866)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (21866)------------------------------
% 0.19/0.52 % (21866)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (21866)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (21866)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (21866)Memory used [KB]: 5628
% 0.19/0.52 % (21866)Time elapsed: 0.125 s
% 0.19/0.52 % (21866)Instructions burned: 5 (million)
% 0.19/0.52 % (21866)------------------------------
% 0.19/0.52 % (21866)------------------------------
% 0.19/0.52 % (21860)Success in time 0.179 s
%------------------------------------------------------------------------------