TSTP Solution File: SWC203+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC203+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 : n008.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.19s 0.55s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 114 ( 44 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 117 ( 21 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 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 : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f595,plain,
$false,
inference(subsumption_resolution,[],[f594,f549]) ).
fof(f549,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f347,plain,
( ssList(sK54)
& ssList(sK55)
& ~ neq(sK53,nil)
& ssList(sK56)
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& neq(sK54,nil)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f105,f346,f345,f344,f343]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& ssList(X3)
& X2 = X3
& X0 = X2
& X1 = X3
& neq(X1,nil) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& X2 = X3
& sK53 = X2
& X1 = X3
& neq(X1,nil) ) ) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& X2 = X3
& sK53 = X2
& X1 = X3
& neq(X1,nil) ) ) )
=> ( ssList(sK54)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& X2 = X3
& sK53 = X2
& sK54 = X3
& neq(sK54,nil) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& X2 = X3
& sK53 = X2
& sK54 = X3
& neq(sK54,nil) ) )
=> ( ssList(sK55)
& ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& neq(sK54,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ~ neq(sK53,nil)
& ssList(X3)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& neq(sK54,nil) )
=> ( ~ neq(sK53,nil)
& ssList(sK56)
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& neq(sK54,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& ssList(X3)
& X2 = X3
& X0 = X2
& X1 = X3
& neq(X1,nil) ) ) )
& ssList(X0) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& ~ neq(X0,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& 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)
=> ( ~ neq(X1,nil)
| neq(X0,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| neq(X0,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f594,plain,
neq(sK53,nil),
inference(backward_demodulation,[],[f544,f593]) ).
fof(f593,plain,
sK53 = sK54,
inference(forward_demodulation,[],[f545,f592]) ).
fof(f592,plain,
sK53 = sK56,
inference(backward_demodulation,[],[f547,f546]) ).
fof(f546,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f547,plain,
sK55 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f545,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f544,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC203+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n008.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:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.52 % (12018)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.52 % (12010)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.19/0.53 % (12001)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.19/0.53 % (12009)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.19/0.53 % (12002)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.54 % (12010)First to succeed.
% 0.19/0.55 % (12017)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.19/0.55 % (12002)Instruction limit reached!
% 0.19/0.55 % (12002)------------------------------
% 0.19/0.55 % (12002)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (12002)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (12002)Termination reason: Unknown
% 0.19/0.55 % (12002)Termination phase: Function definition elimination
% 0.19/0.55
% 0.19/0.55 % (12002)Memory used [KB]: 1279
% 0.19/0.55 % (12002)Time elapsed: 0.011 s
% 0.19/0.55 % (12002)Instructions burned: 7 (million)
% 0.19/0.55 % (12002)------------------------------
% 0.19/0.55 % (12002)------------------------------
% 0.19/0.55 % (12018)Also succeeded, but the first one will report.
% 0.19/0.55 % (12010)Refutation found. Thanks to Tanya!
% 0.19/0.55 % SZS status Theorem for theBenchmark
% 0.19/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.55 % (12010)------------------------------
% 0.19/0.55 % (12010)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (12010)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (12010)Termination reason: Refutation
% 0.19/0.55
% 0.19/0.55 % (12010)Memory used [KB]: 1407
% 0.19/0.55 % (12010)Time elapsed: 0.020 s
% 0.19/0.55 % (12010)Instructions burned: 12 (million)
% 0.19/0.55 % (12010)------------------------------
% 0.19/0.55 % (12010)------------------------------
% 0.19/0.55 % (11994)Success in time 0.198 s
%------------------------------------------------------------------------------