TSTP Solution File: SWC381+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC381+1 : TPTP v8.1.2. 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 : n021.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 May 1 04:01:48 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 5 unt; 0 def)
% Number of atoms : 266 ( 68 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 329 ( 100 ~; 82 |; 122 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 30 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f619,plain,
$false,
inference(avatar_sat_refutation,[],[f596,f601,f606,f610,f615,f618]) ).
fof(f618,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_3
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f617,f608,f598,f603,f589]) ).
fof(f589,plain,
( spl52_1
<=> memberP(sK50,sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f603,plain,
( spl52_4
<=> ssItem(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f598,plain,
( spl52_3
<=> sK49 = cons(sK51,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f608,plain,
( spl52_5
<=> ! [X5] :
( ~ memberP(sK50,X5)
| ~ ssItem(X5)
| cons(X5,nil) != sK49 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_5])]) ).
fof(f617,plain,
( ~ ssItem(sK51)
| ~ memberP(sK50,sK51)
| ~ spl52_3
| ~ spl52_5 ),
inference(trivial_inequality_removal,[],[f616]) ).
fof(f616,plain,
( sK49 != sK49
| ~ ssItem(sK51)
| ~ memberP(sK50,sK51)
| ~ spl52_3
| ~ spl52_5 ),
inference(superposition,[],[f609,f600]) ).
fof(f600,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f598]) ).
fof(f609,plain,
( ! [X5] :
( cons(X5,nil) != sK49
| ~ ssItem(X5)
| ~ memberP(sK50,X5) )
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f615,plain,
spl52_2,
inference(avatar_split_clause,[],[f580,f593]) ).
fof(f593,plain,
( spl52_2
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f580,plain,
neq(sK50,nil),
inference(duplicate_literal_removal,[],[f550]) ).
fof(f550,plain,
( neq(sK50,nil)
| neq(sK50,nil) ),
inference(definition_unfolding,[],[f534,f532,f532]) ).
fof(f532,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( memberP(sK50,sK51)
& sK49 = cons(sK51,nil)
& ssItem(sK51)
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51])],[f223,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK49
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK49
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( memberP(sK50,X4)
& cons(X4,nil) = sK49
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( memberP(sK50,X4)
& cons(X4,nil) = sK49
& ssItem(X4) )
=> ( memberP(sK50,sK51)
& sK49 = cons(sK51,nil)
& ssItem(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5Gu1tMp1pW/Vampire---4.8_30502',co1) ).
fof(f534,plain,
( neq(sK48,nil)
| neq(sK48,nil) ),
inference(cnf_transformation,[],[f337]) ).
fof(f610,plain,
( spl52_5
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f544,f593,f608]) ).
fof(f544,plain,
! [X5] :
( ~ neq(sK50,nil)
| ~ memberP(sK50,X5)
| cons(X5,nil) != sK49
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f540,f532,f533]) ).
fof(f533,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f337]) ).
fof(f540,plain,
! [X5] :
( ~ neq(sK50,nil)
| ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f337]) ).
fof(f606,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f541,f593,f603]) ).
fof(f541,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f337]) ).
fof(f601,plain,
( spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f542,f593,f598]) ).
fof(f542,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f337]) ).
fof(f596,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f543,f593,f589]) ).
fof(f543,plain,
( ~ neq(sK50,nil)
| memberP(sK50,sK51) ),
inference(cnf_transformation,[],[f337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC381+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % 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.16/0.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:21:26 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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/tmp/tmp.5Gu1tMp1pW/Vampire---4.8_30502
% 0.55/0.76 % (30759)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 Vampire---4 for (2996ds/83Mi)
% 0.55/0.76 % (30753)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.76 % (30754)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 Vampire---4 for (2996ds/51Mi)
% 0.55/0.76 % (30756)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.76 % (30757)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.76 % (30758)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.61/0.76 % (30760)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.61/0.76 % (30758)Refutation not found, incomplete strategy% (30758)------------------------------
% 0.61/0.76 % (30758)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (30758)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.76
% 0.61/0.76 % (30758)Memory used [KB]: 1145
% 0.61/0.76 % (30758)Time elapsed: 0.004 s
% 0.61/0.76 % (30758)Instructions burned: 5 (million)
% 0.61/0.76 % (30758)------------------------------
% 0.61/0.76 % (30758)------------------------------
% 0.61/0.76 % (30760)Refutation not found, incomplete strategy% (30760)------------------------------
% 0.61/0.76 % (30760)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (30760)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.76
% 0.61/0.76 % (30760)Memory used [KB]: 1149
% 0.61/0.76 % (30760)Time elapsed: 0.005 s
% 0.61/0.76 % (30760)Instructions burned: 5 (million)
% 0.61/0.76 % (30760)------------------------------
% 0.61/0.76 % (30760)------------------------------
% 0.61/0.77 % (30755)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.61/0.77 % (30754)First to succeed.
% 0.61/0.77 % (30761)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 Vampire---4 for (2996ds/55Mi)
% 0.61/0.77 % (30754)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for Vampire---4
% 0.61/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77 % (30754)------------------------------
% 0.61/0.77 % (30754)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (30754)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (30754)Memory used [KB]: 1380
% 0.61/0.77 % (30754)Time elapsed: 0.012 s
% 0.61/0.77 % (30754)Instructions burned: 17 (million)
% 0.61/0.77 % (30754)------------------------------
% 0.61/0.77 % (30754)------------------------------
% 0.61/0.77 % (30749)Success in time 0.39 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------