TSTP Solution File: SWC257+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC257+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 : n009.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:44 EDT 2022
% Result : Theorem 0.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 252 ( 84 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 305 ( 91 ~; 86 |; 112 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 27 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f718,plain,
$false,
inference(avatar_sat_refutation,[],[f634,f643,f653,f701,f709]) ).
fof(f709,plain,
~ spl58_6,
inference(avatar_contradiction_clause,[],[f708]) ).
fof(f708,plain,
( $false
| ~ spl58_6 ),
inference(subsumption_resolution,[],[f702,f410]) ).
fof(f410,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f702,plain,
( ~ totalorderedP(nil)
| ~ spl58_6 ),
inference(backward_demodulation,[],[f568,f629]) ).
fof(f629,plain,
( nil = sK14
| ~ spl58_6 ),
inference(avatar_component_clause,[],[f627]) ).
fof(f627,plain,
( spl58_6
<=> nil = sK14 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_6])]) ).
fof(f568,plain,
~ totalorderedP(sK14),
inference(definition_unfolding,[],[f388,f389]) ).
fof(f389,plain,
sK12 = sK14,
inference(cnf_transformation,[],[f253]) ).
fof(f253,plain,
( ssList(sK13)
& ssList(sK14)
& sK15 = sK13
& ( ( nil = sK14
& nil = sK15 )
| ( ! [X5] :
( ~ memberP(sK15,X5)
| sK16 = X5
| ~ ssItem(X5)
| ~ leq(sK16,X5) )
& sK14 = cons(sK16,nil)
& ssItem(sK16)
& memberP(sK15,sK16) ) )
& sK12 = sK14
& ~ totalorderedP(sK12)
& ssList(sK15)
& ssList(sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15,sK16])],[f208,f252,f251,f250,f249,f248]) ).
fof(f248,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& X0 = X2
& ~ totalorderedP(X0)
& ssList(X3) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = X2
& ~ totalorderedP(sK12)
& ssList(X3) ) ) )
& ssList(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f249,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = X2
& ~ totalorderedP(sK12)
& ssList(X3) ) ) )
=> ( ssList(sK13)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK13 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = X2
& ~ totalorderedP(sK12)
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK13 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = X2
& ~ totalorderedP(sK12)
& ssList(X3) ) )
=> ( ssList(sK14)
& ? [X3] :
( sK13 = X3
& ( ( nil = sK14
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK14
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = sK14
& ~ totalorderedP(sK12)
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X3] :
( sK13 = X3
& ( ( nil = sK14
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK14
& ssItem(X4)
& memberP(X3,X4) ) )
& sK12 = sK14
& ~ totalorderedP(sK12)
& ssList(X3) )
=> ( sK15 = sK13
& ( ( nil = sK14
& nil = sK15 )
| ? [X4] :
( ! [X5] :
( ~ memberP(sK15,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK14
& ssItem(X4)
& memberP(sK15,X4) ) )
& sK12 = sK14
& ~ totalorderedP(sK12)
& ssList(sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X4] :
( ! [X5] :
( ~ memberP(sK15,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK14
& ssItem(X4)
& memberP(sK15,X4) )
=> ( ! [X5] :
( ~ memberP(sK15,X5)
| sK16 = X5
| ~ ssItem(X5)
| ~ leq(sK16,X5) )
& sK14 = cons(sK16,nil)
& ssItem(sK16)
& memberP(sK15,sK16) ) ),
introduced(choice_axiom,[]) ).
fof(f208,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& X0 = X2
& ~ totalorderedP(X0)
& ssList(X3) ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( totalorderedP(X0)
| ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ? [X5] :
( memberP(X3,X5)
& leq(X4,X5)
& ssItem(X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( totalorderedP(X0)
| ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ? [X5] :
( memberP(X3,X5)
& leq(X4,X5)
& ssItem(X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f388,plain,
~ totalorderedP(sK12),
inference(cnf_transformation,[],[f253]) ).
fof(f701,plain,
( ~ spl58_7
| ~ spl58_8
| ~ spl58_9 ),
inference(avatar_contradiction_clause,[],[f700]) ).
fof(f700,plain,
( $false
| ~ spl58_7
| ~ spl58_8
| ~ spl58_9 ),
inference(subsumption_resolution,[],[f699,f642]) ).
fof(f642,plain,
( ssItem(sK16)
| ~ spl58_9 ),
inference(avatar_component_clause,[],[f640]) ).
fof(f640,plain,
( spl58_9
<=> ssItem(sK16) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_9])]) ).
fof(f699,plain,
( ~ ssItem(sK16)
| ~ spl58_7
| ~ spl58_8 ),
inference(subsumption_resolution,[],[f698,f568]) ).
fof(f698,plain,
( totalorderedP(sK14)
| ~ ssItem(sK16)
| ~ spl58_7
| ~ spl58_8 ),
inference(superposition,[],[f637,f633]) ).
fof(f633,plain,
( sK14 = cons(sK16,nil)
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl58_7
<=> sK14 = cons(sK16,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_7])]) ).
fof(f637,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl58_8 ),
inference(avatar_component_clause,[],[f636]) ).
fof(f636,plain,
( spl58_8
<=> ! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_8])]) ).
fof(f653,plain,
spl58_8,
inference(avatar_split_clause,[],[f461,f636]) ).
fof(f461,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f198,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f643,plain,
( spl58_9
| spl58_6 ),
inference(avatar_split_clause,[],[f395,f627,f640]) ).
fof(f395,plain,
( nil = sK14
| ssItem(sK16) ),
inference(cnf_transformation,[],[f253]) ).
fof(f634,plain,
( spl58_6
| spl58_7 ),
inference(avatar_split_clause,[],[f396,f631,f627]) ).
fof(f396,plain,
( sK14 = cons(sK16,nil)
| nil = sK14 ),
inference(cnf_transformation,[],[f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC257+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.13/0.34 % Computer : n009.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:36:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.50 % (3080)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.50 % (3072)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.50 % (3087)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.50 % (3061)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.18/0.51 % (3070)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.18/0.51 % (3079)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.18/0.51 % (3088)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.18/0.52 % (3081)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.18/0.52 % (3059)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.18/0.52 % (3077)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.52 % (3066)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.52 % (3073)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.18/0.52 % (3067)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.18/0.52 % (3067)Instruction limit reached!
% 0.18/0.52 % (3067)------------------------------
% 0.18/0.52 % (3067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (3067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (3067)Termination reason: Unknown
% 0.18/0.52 % (3067)Termination phase: Preprocessing 2
% 0.18/0.52
% 0.18/0.52 % (3067)Memory used [KB]: 1023
% 0.18/0.52 % (3067)Time elapsed: 0.002 s
% 0.18/0.52 % (3067)Instructions burned: 2 (million)
% 0.18/0.52 % (3067)------------------------------
% 0.18/0.52 % (3067)------------------------------
% 0.18/0.52 % (3063)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.52 % (3066)Instruction limit reached!
% 0.18/0.52 % (3066)------------------------------
% 0.18/0.52 % (3066)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (3066)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (3066)Termination reason: Unknown
% 0.18/0.52 % (3066)Termination phase: Function definition elimination
% 0.18/0.52
% 0.18/0.52 % (3066)Memory used [KB]: 1279
% 0.18/0.52 % (3066)Time elapsed: 0.006 s
% 0.18/0.52 % (3066)Instructions burned: 8 (million)
% 0.18/0.52 % (3066)------------------------------
% 0.18/0.52 % (3066)------------------------------
% 0.18/0.52 % (3062)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.18/0.52 % (3080)First to succeed.
% 0.18/0.52 % (3081)Also succeeded, but the first one will report.
% 0.18/0.53 % (3080)Refutation found. Thanks to Tanya!
% 0.18/0.53 % SZS status Theorem for theBenchmark
% 0.18/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53 % (3080)------------------------------
% 0.18/0.53 % (3080)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (3080)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (3080)Termination reason: Refutation
% 0.18/0.53
% 0.18/0.53 % (3080)Memory used [KB]: 6012
% 0.18/0.53 % (3080)Time elapsed: 0.112 s
% 0.18/0.53 % (3080)Instructions burned: 19 (million)
% 0.18/0.53 % (3080)------------------------------
% 0.18/0.53 % (3080)------------------------------
% 0.18/0.53 % (3058)Success in time 0.179 s
%------------------------------------------------------------------------------