TSTP Solution File: SWC258+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC258+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Tue May 21 04:37:31 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 300 ( 103 equ)
% Maximal formula atoms : 32 ( 7 avg)
% Number of connectives : 366 ( 108 ~; 101 |; 135 &)
% ( 5 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 71 ( 34 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f309,plain,
$false,
inference(avatar_sat_refutation,[],[f274,f279,f291,f308]) ).
fof(f308,plain,
( ~ spl17_4
| ~ spl17_5 ),
inference(avatar_contradiction_clause,[],[f307]) ).
fof(f307,plain,
( $false
| ~ spl17_4
| ~ spl17_5 ),
inference(subsumption_resolution,[],[f306,f278]) ).
fof(f278,plain,
( ssItem(sK4)
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f276,plain,
( spl17_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).
fof(f306,plain,
( ~ ssItem(sK4)
| ~ spl17_4 ),
inference(subsumption_resolution,[],[f302,f199]) ).
fof(f199,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f302,plain,
( ~ ssList(nil)
| ~ ssItem(sK4)
| ~ spl17_4 ),
inference(resolution,[],[f299,f250]) ).
fof(f250,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f217]) ).
fof(f217,plain,
! [X0,X1] :
( totalorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f159]) ).
fof(f159,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(f299,plain,
( ~ totalorderedP(cons(sK4,nil))
| ~ spl17_4 ),
inference(superposition,[],[f245,f273]) ).
fof(f273,plain,
( sK2 = cons(sK4,nil)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f271,plain,
( spl17_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f245,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f179,f178]) ).
fof(f178,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(X5,sK4)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f142,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(X5,sK4)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f179,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f143]) ).
fof(f291,plain,
~ spl17_2,
inference(avatar_contradiction_clause,[],[f290]) ).
fof(f290,plain,
( $false
| ~ spl17_2 ),
inference(subsumption_resolution,[],[f288,f219]) ).
fof(f219,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f288,plain,
( ~ totalorderedP(nil)
| ~ spl17_2 ),
inference(superposition,[],[f245,f263]) ).
fof(f263,plain,
( nil = sK2
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl17_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f279,plain,
( spl17_5
| spl17_2 ),
inference(avatar_split_clause,[],[f184,f261,f276]) ).
fof(f184,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f143]) ).
fof(f274,plain,
( spl17_4
| spl17_2 ),
inference(avatar_split_clause,[],[f185,f261,f271]) ).
fof(f185,plain,
( nil = sK2
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC258+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:20:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.74 % (27000)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.74 % (26993)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (26995)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.75 % (26994)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.75 % (26997)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.75 % (26996)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.75 % (26998)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.75 % (26999)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.75 % (27000)Refutation not found, incomplete strategy% (27000)------------------------------
% 0.55/0.75 % (27000)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (27000)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (27000)Memory used [KB]: 1176
% 0.55/0.75 % (27000)Time elapsed: 0.003 s
% 0.55/0.75 % (27000)Instructions burned: 6 (million)
% 0.55/0.75 % (27000)------------------------------
% 0.55/0.75 % (27000)------------------------------
% 0.55/0.75 % (27001)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.55/0.75 % (26998)First to succeed.
% 0.55/0.75 % (26996)Also succeeded, but the first one will report.
% 0.55/0.75 % (26998)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26992"
% 0.55/0.75 % (26995)Also succeeded, but the first one will report.
% 0.55/0.75 % (26998)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for theBenchmark
% 0.55/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.75 % (26998)------------------------------
% 0.55/0.75 % (26998)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (26998)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (26998)Memory used [KB]: 1190
% 0.55/0.75 % (26998)Time elapsed: 0.007 s
% 0.55/0.75 % (26998)Instructions burned: 8 (million)
% 0.55/0.75 % (26992)Success in time 0.39 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------