TSTP Solution File: SWC047+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC047+1 : TPTP v8.1.0. Released v2.4.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 : n015.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 18:41:23 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 7 unt; 0 def)
% Number of atoms : 161 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 200 ( 83 ~; 78 |; 26 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 34 ( 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f558,plain,
$false,
inference(avatar_sat_refutation,[],[f485,f488,f495,f498,f555,f557]) ).
fof(f557,plain,
spl51_7,
inference(avatar_contradiction_clause,[],[f556]) ).
fof(f556,plain,
( $false
| spl51_7 ),
inference(resolution,[],[f554,f239]) ).
fof(f239,plain,
ssList(sK1),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X0,X4) ) ) )
& X2 = X3
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X0,X4) ) ) )
& X1 = X3
& X2 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& rearsegP(X1,X4) ) ) )
| X1 != X3
| X2 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& rearsegP(X1,X4) ) ) )
| X1 != X3
| X2 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f554,plain,
( ~ ssList(sK1)
| spl51_7 ),
inference(avatar_component_clause,[],[f552]) ).
fof(f552,plain,
( spl51_7
<=> ssList(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).
fof(f555,plain,
( ~ spl51_6
| ~ spl51_7
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f550,f483,f552,f492]) ).
fof(f492,plain,
( spl51_6
<=> neq(sK1,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).
fof(f483,plain,
( spl51_5
<=> ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).
fof(f550,plain,
( ~ ssList(sK1)
| ~ neq(sK1,nil)
| ~ spl51_5 ),
inference(duplicate_literal_removal,[],[f549]) ).
fof(f549,plain,
( ~ ssList(sK1)
| ~ neq(sK1,nil)
| ~ ssList(sK1)
| ~ spl51_5 ),
inference(resolution,[],[f484,f410]) ).
fof(f410,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f484,plain,
( ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f498,plain,
( spl51_6
| spl51_4 ),
inference(avatar_split_clause,[],[f497,f479,f492]) ).
fof(f479,plain,
( spl51_4
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_4])]) ).
fof(f497,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(forward_demodulation,[],[f496,f424]) ).
fof(f424,plain,
sK1 = sK4,
inference(definition_unfolding,[],[f233,f234]) ).
fof(f234,plain,
sK3 = sK4,
inference(cnf_transformation,[],[f131]) ).
fof(f233,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f131]) ).
fof(f496,plain,
( nil = sK4
| neq(sK1,nil) ),
inference(forward_demodulation,[],[f425,f424]) ).
fof(f425,plain,
( neq(sK4,nil)
| nil = sK4 ),
inference(definition_unfolding,[],[f232,f236,f236]) ).
fof(f236,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f131]) ).
fof(f232,plain,
( neq(sK2,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f131]) ).
fof(f495,plain,
( spl51_6
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f490,f479,f492]) ).
fof(f490,plain,
( nil != sK1
| neq(sK1,nil) ),
inference(forward_demodulation,[],[f426,f424]) ).
fof(f426,plain,
( neq(sK4,nil)
| nil != sK1 ),
inference(definition_unfolding,[],[f231,f236]) ).
fof(f231,plain,
( neq(sK2,nil)
| nil != sK1 ),
inference(cnf_transformation,[],[f131]) ).
fof(f488,plain,
( ~ spl51_4
| spl51_5 ),
inference(avatar_split_clause,[],[f487,f483,f479]) ).
fof(f487,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ ssList(X4)
| nil != sK1 ),
inference(duplicate_literal_removal,[],[f486]) ).
fof(f486,plain,
! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| nil != sK1 ),
inference(forward_demodulation,[],[f427,f424]) ).
fof(f427,plain,
! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK4,X4)
| ~ ssList(X4)
| nil != sK1
| ~ neq(X4,nil) ),
inference(definition_unfolding,[],[f230,f236]) ).
fof(f230,plain,
! [X4] :
( ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK2,X4)
| ~ ssList(X4)
| nil != sK1 ),
inference(cnf_transformation,[],[f131]) ).
fof(f485,plain,
( spl51_4
| spl51_5 ),
inference(avatar_split_clause,[],[f477,f483,f479]) ).
fof(f477,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| nil = sK1 ),
inference(forward_demodulation,[],[f476,f424]) ).
fof(f476,plain,
! [X4] :
( nil = sK4
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4) ),
inference(duplicate_literal_removal,[],[f475]) ).
fof(f475,plain,
! [X4] :
( ~ rearsegP(sK1,X4)
| ~ ssList(X4)
| nil = sK4
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4) ),
inference(forward_demodulation,[],[f428,f424]) ).
fof(f428,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK4,X4)
| ~ ssList(X4)
| nil = sK4 ),
inference(definition_unfolding,[],[f229,f236,f236]) ).
fof(f229,plain,
! [X4] :
( ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK2,X4)
| ~ ssList(X4)
| nil = sK2 ),
inference(cnf_transformation,[],[f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC047+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.14/0.35 % Computer : n015.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 18:12:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (13734)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (13735)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.21/0.51 % (13736)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (13760)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.52 % (13733)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.21/0.52 % (13748)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.52 % (13743)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.21/0.52 % (13730)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.53 % (13740)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.21/0.53 % (13761)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.53 % (13745)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.21/0.53 % (13733)First to succeed.
% 0.21/0.53 % (13755)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.21/0.53 % (13746)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.53 % (13754)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.21/0.53 % (13759)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.54 % (13757)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.54 TRYING [1]
% 0.21/0.54 % (13758)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.21/0.54 % (13732)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.21/0.54 % (13744)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.54 % (13738)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (13752)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.21/0.54 % (13756)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.55 % (13747)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.21/0.55 % (13749)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.55 % (13760)Also succeeded, but the first one will report.
% 0.21/0.55 % (13733)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (13733)------------------------------
% 0.21/0.55 % (13733)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (13733)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (13733)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (13733)Memory used [KB]: 5884
% 0.21/0.55 % (13733)Time elapsed: 0.124 s
% 0.21/0.55 % (13733)Instructions burned: 15 (million)
% 0.21/0.55 % (13733)------------------------------
% 0.21/0.55 % (13733)------------------------------
% 0.21/0.55 % (13726)Success in time 0.194 s
%------------------------------------------------------------------------------