TSTP Solution File: SWC121+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC121+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 : n017.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:52 EDT 2022
% Result : Theorem 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 175 ( 28 equ)
% Maximal formula atoms : 26 ( 9 avg)
% Number of connectives : 210 ( 54 ~; 42 |; 102 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_27,type,
sQ58_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_28,type,
sQ59_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_29,type,
sQ60_eqProxy: ( $real * $real ) > $o ).
fof(f975,plain,
$false,
inference(sat_instgen_refutation,[],[f562,f437,f439,f973]) ).
fof(f973,plain,
neq(sK34,nil),
inference(duplicate_literal_removal,[],[f567]) ).
fof(f567,plain,
( neq(sK34,nil)
| neq(sK34,nil) ),
inference(definition_unfolding,[],[f432,f440,f440]) ).
fof(f440,plain,
sK32 = sK34,
inference(cnf_transformation,[],[f289]) ).
fof(f289,plain,
( ssList(sK32)
& sK31 = sK33
& sK32 = sK34
& ( ( ~ neq(sK34,nil)
& neq(sK32,nil) )
| ( segmentP(sK34,sK33)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(sK33,nil)
& neq(sK32,nil) ) )
& ssList(sK34)
& ssList(sK33)
& ssList(sK31) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34])],[f178,f288,f287,f286,f285]) ).
fof(f285,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X2,nil)
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK31 = X2
& X1 = X3
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(X1,sK31)
| ~ neq(sK31,nil) )
& neq(X2,nil)
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK31 = X2
& X1 = X3
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(X1,sK31)
| ~ neq(sK31,nil) )
& neq(X2,nil)
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK32)
& ? [X2] :
( ? [X3] :
( sK31 = X2
& sK32 = X3
& ( ( ~ neq(X3,nil)
& neq(sK32,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(X2,nil)
& neq(sK32,nil) ) )
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X2] :
( ? [X3] :
( sK31 = X2
& sK32 = X3
& ( ( ~ neq(X3,nil)
& neq(sK32,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(X2,nil)
& neq(sK32,nil) ) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( sK31 = sK33
& sK32 = X3
& ( ( ~ neq(X3,nil)
& neq(sK32,nil) )
| ( segmentP(X3,sK33)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(sK33,nil)
& neq(sK32,nil) ) )
& ssList(X3) )
& ssList(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
( ? [X3] :
( sK31 = sK33
& sK32 = X3
& ( ( ~ neq(X3,nil)
& neq(sK32,nil) )
| ( segmentP(X3,sK33)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(sK33,nil)
& neq(sK32,nil) ) )
& ssList(X3) )
=> ( sK31 = sK33
& sK32 = sK34
& ( ( ~ neq(sK34,nil)
& neq(sK32,nil) )
| ( segmentP(sK34,sK33)
& ( ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) )
& neq(sK33,nil)
& neq(sK32,nil) ) )
& ssList(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f178,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X2,nil)
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f177]) ).
fof(f177,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( segmentP(X3,X2)
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X2,nil)
& neq(X1,nil) ) )
& 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)
=> ( X0 != X2
| ( ( ~ neq(X1,nil)
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( ~ neq(X1,nil)
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f432,plain,
( neq(sK32,nil)
| neq(sK32,nil) ),
inference(cnf_transformation,[],[f289]) ).
fof(f439,plain,
( segmentP(sK34,sK33)
| ~ neq(sK34,nil) ),
inference(cnf_transformation,[],[f289]) ).
fof(f437,plain,
( ~ neq(sK34,nil)
| neq(sK33,nil) ),
inference(cnf_transformation,[],[f289]) ).
fof(f562,plain,
( ~ neq(sK34,nil)
| ~ neq(sK33,nil)
| ~ segmentP(sK34,sK33) ),
inference(definition_unfolding,[],[f438,f440,f441,f441]) ).
fof(f441,plain,
sK31 = sK33,
inference(cnf_transformation,[],[f289]) ).
fof(f438,plain,
( ~ neq(sK34,nil)
| ~ segmentP(sK32,sK31)
| ~ neq(sK31,nil) ),
inference(cnf_transformation,[],[f289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC121+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 17:43:20 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.44 % (8083)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.17/0.47 % (8093)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.17/0.48 % (8099)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.17/0.48 TRYING [1]
% 0.17/0.48 % (8087)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.17/0.49 % (8093)First to succeed.
% 0.17/0.49 % (8078)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.17/0.49 % (8102)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.17/0.49 TRYING [2]
% 0.17/0.49 % (8082)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.17/0.50 % (8086)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.17/0.50 % (8107)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.17/0.50 % (8108)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.17/0.50 % (8085)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.50 % (8100)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.17/0.50 % (8094)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.17/0.50 % (8105)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.17/0.50 % (8089)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.51 % (8087)Also succeeded, but the first one will report.
% 0.17/0.51 % (8081)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.51 % (8093)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Theorem for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (8093)------------------------------
% 0.17/0.51 % (8093)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.51 % (8093)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.51 % (8093)Termination reason: Refutation
% 0.17/0.51
% 0.17/0.51 % (8093)Memory used [KB]: 6396
% 0.17/0.51 % (8093)Time elapsed: 0.008 s
% 0.17/0.51 % (8093)Instructions burned: 15 (million)
% 0.17/0.51 % (8093)------------------------------
% 0.17/0.51 % (8093)------------------------------
% 0.17/0.51 % (8074)Success in time 0.178 s
%------------------------------------------------------------------------------