TSTP Solution File: SWC205+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC205+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 : n019.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:42:23 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 194 ( 91 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 236 ( 75 ~; 53 |; 92 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 44 ( 20 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f783,plain,
$false,
inference(subsumption_resolution,[],[f782,f495]) ).
fof(f495,plain,
ssList(sK42),
inference(cnf_transformation,[],[f313]) ).
fof(f313,plain,
( ssList(sK40)
& ssList(sK41)
& sK40 = sK42
& sK41 = sK43
& ( nil = sK42
| nil != sK43 )
& ssList(sK43)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = sK43
| nil != sK42 )
& ssList(sK42) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK40,sK41,sK42,sK43])],[f113,f312,f311,f310,f309]) ).
fof(f309,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(X0,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) ) )
=> ( ssList(sK40)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK40 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f310,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK40 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) )
=> ( ssList(sK41)
& ? [X2] :
( ? [X3] :
( sK40 = X2
& sK41 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f311,plain,
( ? [X2] :
( ? [X3] :
( sK40 = X2
& sK41 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
=> ( ? [X3] :
( sK40 = sK42
& sK41 = X3
& ( nil = sK42
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = X3
| nil != sK42 ) )
& ssList(sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f312,plain,
( ? [X3] :
( sK40 = sK42
& sK41 = X3
& ( nil = sK42
| nil != X3 )
& ssList(X3)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = X3
| nil != sK42 ) )
=> ( sK40 = sK42
& sK41 = sK43
& ( nil = sK42
| nil != sK43 )
& ssList(sK43)
& ~ neq(sK40,nil)
& neq(sK41,nil)
& ( nil = sK43
| nil != sK42 ) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ~ neq(X0,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) ) ),
inference(flattening,[],[f112]) ).
fof(f112,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ neq(X0,nil)
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& neq(X1,nil)
& 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 = X2
& nil != X3 )
| neq(X0,nil)
| X1 != X3
| X0 != X2
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| X1 != X3
| X0 != X2
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f782,plain,
~ ssList(sK42),
inference(subsumption_resolution,[],[f781,f546]) ).
fof(f546,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f781,plain,
( ~ ssList(nil)
| ~ ssList(sK42) ),
inference(subsumption_resolution,[],[f740,f559]) ).
fof(f559,plain,
~ neq(sK42,nil),
inference(definition_unfolding,[],[f498,f502]) ).
fof(f502,plain,
sK40 = sK42,
inference(cnf_transformation,[],[f313]) ).
fof(f498,plain,
~ neq(sK40,nil),
inference(cnf_transformation,[],[f313]) ).
fof(f740,plain,
( neq(sK42,nil)
| ~ ssList(nil)
| ~ ssList(sK42) ),
inference(extensionality_resolution,[],[f355,f599]) ).
fof(f599,plain,
nil != sK42,
inference(subsumption_resolution,[],[f598,f546]) ).
fof(f598,plain,
( nil != sK42
| ~ ssList(nil) ),
inference(resolution,[],[f591,f595]) ).
fof(f595,plain,
( neq(nil,nil)
| nil != sK42 ),
inference(superposition,[],[f560,f496]) ).
fof(f496,plain,
( nil = sK43
| nil != sK42 ),
inference(cnf_transformation,[],[f313]) ).
fof(f560,plain,
neq(sK43,nil),
inference(definition_unfolding,[],[f497,f501]) ).
fof(f501,plain,
sK41 = sK43,
inference(cnf_transformation,[],[f313]) ).
fof(f497,plain,
neq(sK41,nil),
inference(cnf_transformation,[],[f313]) ).
fof(f591,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f561]) ).
fof(f561,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f354]) ).
fof(f354,plain,
! [X0,X1] :
( ~ ssList(X0)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f232]) ).
fof(f232,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f183]) ).
fof(f183,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f355,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f232]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC205+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:37:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (21373)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.20/0.49 % (21365)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.20/0.49 % (21366)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.20/0.50 % (21357)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.20/0.50 % (21361)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.51 % (21374)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.20/0.51 % (21358)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (21358)Instruction limit reached!
% 0.20/0.51 % (21358)------------------------------
% 0.20/0.51 % (21358)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (21358)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (21358)Termination reason: Unknown
% 0.20/0.51 % (21358)Termination phase: Function definition elimination
% 0.20/0.51
% 0.20/0.51 % (21358)Memory used [KB]: 1279
% 0.20/0.51 % (21358)Time elapsed: 0.007 s
% 0.20/0.51 % (21358)Instructions burned: 8 (million)
% 0.20/0.51 % (21358)------------------------------
% 0.20/0.51 % (21358)------------------------------
% 0.20/0.52 % (21351)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.20/0.52 % (21355)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (21356)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.20/0.53 % (21376)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.53 TRYING [1]
% 0.20/0.53 % (21353)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.20/0.53 % (21352)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 TRYING [2]
% 0.20/0.53 % (21362)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53 % (21354)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.53 % (21373)First to succeed.
% 0.20/0.53 % (21373)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (21373)------------------------------
% 0.20/0.53 % (21373)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (21373)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (21373)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (21373)Memory used [KB]: 1407
% 0.20/0.53 % (21373)Time elapsed: 0.082 s
% 0.20/0.53 % (21373)Instructions burned: 20 (million)
% 0.20/0.53 % (21373)------------------------------
% 0.20/0.53 % (21373)------------------------------
% 0.20/0.53 % (21350)Success in time 0.187 s
%------------------------------------------------------------------------------