TSTP Solution File: SWC365+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC365+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 : n005.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:43:24 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 169 ( 54 equ)
% Maximal formula atoms : 26 ( 8 avg)
% Number of connectives : 200 ( 50 ~; 36 |; 102 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f618,plain,
$false,
inference(subsumption_resolution,[],[f617,f559]) ).
fof(f559,plain,
~ rearsegP(sK39,sK36),
inference(definition_unfolding,[],[f500,f501]) ).
fof(f501,plain,
sK37 = sK39,
inference(cnf_transformation,[],[f308]) ).
fof(f308,plain,
( ssList(sK37)
& sK38 = sK36
& sK37 = sK39
& ~ rearsegP(sK37,sK36)
& ( ~ neq(sK39,nil)
| ( rearsegP(sK39,sK38)
& neq(sK38,nil) ) )
& ssList(sK39)
& ( nil != sK39
| nil = sK38 )
& neq(sK37,nil)
& ssList(sK38)
& ssList(sK36) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK36,sK37,sK38,sK39])],[f210,f307,f306,f305,f304]) ).
fof(f304,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ~ rearsegP(X1,X0)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(X1,nil) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK36 = X2
& X1 = X3
& ~ rearsegP(X1,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(X1,nil) )
& ssList(X2) ) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f305,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK36 = X2
& X1 = X3
& ~ rearsegP(X1,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(X1,nil) )
& ssList(X2) ) )
=> ( ssList(sK37)
& ? [X2] :
( ? [X3] :
( sK36 = X2
& sK37 = X3
& ~ rearsegP(sK37,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(sK37,nil) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f306,plain,
( ? [X2] :
( ? [X3] :
( sK36 = X2
& sK37 = X3
& ~ rearsegP(sK37,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(sK37,nil) )
& ssList(X2) )
=> ( ? [X3] :
( sK38 = sK36
& sK37 = X3
& ~ rearsegP(sK37,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,sK38)
& neq(sK38,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = sK38 )
& neq(sK37,nil) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f307,plain,
( ? [X3] :
( sK38 = sK36
& sK37 = X3
& ~ rearsegP(sK37,sK36)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,sK38)
& neq(sK38,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = sK38 )
& neq(sK37,nil) )
=> ( sK38 = sK36
& sK37 = sK39
& ~ rearsegP(sK37,sK36)
& ( ~ neq(sK39,nil)
| ( rearsegP(sK39,sK38)
& neq(sK38,nil) ) )
& ssList(sK39)
& ( nil != sK39
| nil = sK38 )
& neq(sK37,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f210,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ~ rearsegP(X1,X0)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& neq(X1,nil) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f209]) ).
fof(f209,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ~ rearsegP(X1,X0)
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& 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)
=> ( X1 != X3
| rearsegP(X1,X0)
| ( neq(X3,nil)
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| ( nil != X2
& nil = X3 )
| ~ neq(X1,nil)
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| rearsegP(X1,X0)
| ( neq(X3,nil)
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| ( nil != X2
& nil = X3 )
| ~ neq(X1,nil)
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f500,plain,
~ rearsegP(sK37,sK36),
inference(cnf_transformation,[],[f308]) ).
fof(f617,plain,
rearsegP(sK39,sK36),
inference(subsumption_resolution,[],[f560,f563]) ).
fof(f563,plain,
neq(sK39,nil),
inference(definition_unfolding,[],[f495,f501]) ).
fof(f495,plain,
neq(sK37,nil),
inference(cnf_transformation,[],[f308]) ).
fof(f560,plain,
( ~ neq(sK39,nil)
| rearsegP(sK39,sK36) ),
inference(definition_unfolding,[],[f499,f502]) ).
fof(f502,plain,
sK38 = sK36,
inference(cnf_transformation,[],[f308]) ).
fof(f499,plain,
( ~ neq(sK39,nil)
| rearsegP(sK39,sK38) ),
inference(cnf_transformation,[],[f308]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.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.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:51:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (23499)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.50 % (23515)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.50 % (23501)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.20/0.50 % (23500)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (23500)Instruction limit reached!
% 0.20/0.50 % (23500)------------------------------
% 0.20/0.50 % (23500)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (23500)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (23500)Termination reason: Unknown
% 0.20/0.50 % (23500)Termination phase: Preprocessing 3
% 0.20/0.50
% 0.20/0.50 % (23500)Memory used [KB]: 1023
% 0.20/0.50 % (23500)Time elapsed: 0.004 s
% 0.20/0.50 % (23500)Instructions burned: 3 (million)
% 0.20/0.50 % (23500)------------------------------
% 0.20/0.50 % (23500)------------------------------
% 0.20/0.50 % (23509)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.50 % (23517)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.50 % (23507)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.51 % (23496)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.51 % (23518)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.51 % (23493)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.51 % (23508)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.20/0.51 % (23502)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 % (23497)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.51 % (23499)Instruction limit reached!
% 0.20/0.51 % (23499)------------------------------
% 0.20/0.51 % (23499)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (23499)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (23499)Termination reason: Unknown
% 0.20/0.51 % (23499)Termination phase: Property scanning
% 0.20/0.51
% 0.20/0.51 % (23499)Memory used [KB]: 1279
% 0.20/0.51 % (23499)Time elapsed: 0.005 s
% 0.20/0.51 % (23499)Instructions burned: 7 (million)
% 0.20/0.51 % (23499)------------------------------
% 0.20/0.51 % (23499)------------------------------
% 0.20/0.52 % (23505)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (23495)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.52 % (23494)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.52 % (23498)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.52 % (23517)First to succeed.
% 0.20/0.53 % (23514)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.53 % (23513)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.53 % (23510)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53 % (23503)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 % (23512)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.20/0.53 % (23517)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 % (23517)------------------------------
% 0.20/0.53 % (23517)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (23517)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (23517)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (23517)Memory used [KB]: 5884
% 0.20/0.53 % (23517)Time elapsed: 0.020 s
% 0.20/0.53 % (23517)Instructions burned: 14 (million)
% 0.20/0.53 % (23517)------------------------------
% 0.20/0.53 % (23517)------------------------------
% 0.20/0.53 % (23491)Success in time 0.183 s
%------------------------------------------------------------------------------