TSTP Solution File: SWC373+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC373+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 : n024.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 : Sun May 5 09:50:40 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 62 ( 13 unt; 0 def)
% Number of atoms : 280 ( 58 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 330 ( 112 ~; 98 |; 94 &)
% ( 6 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 101 ( 60 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f529,plain,
$false,
inference(avatar_sat_refutation,[],[f238,f381,f528]) ).
fof(f528,plain,
( ~ spl11_1
| ~ spl11_6 ),
inference(avatar_contradiction_clause,[],[f527]) ).
fof(f527,plain,
( $false
| ~ spl11_1
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f526,f214]) ).
fof(f214,plain,
~ segmentP(sK3,sK2),
inference(definition_unfolding,[],[f169,f166,f167]) ).
fof(f167,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
( ~ segmentP(sK1,sK0)
& rearsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK0)
& rearsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK0)
& rearsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ segmentP(sK1,sK0)
& rearsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( ~ segmentP(sK1,sK0)
& rearsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ segmentP(sK1,sK0)
& rearsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( ~ segmentP(sK1,sK0)
& rearsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ segmentP(sK1,sK0)
& rearsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& 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)
=> ( segmentP(X1,X0)
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X1,X0)
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6GFRtiHnyx/Vampire---4.8_15858',co1) ).
fof(f166,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f142]) ).
fof(f169,plain,
~ segmentP(sK1,sK0),
inference(cnf_transformation,[],[f142]) ).
fof(f526,plain,
( segmentP(sK3,sK2)
| ~ spl11_1
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f525,f226]) ).
fof(f226,plain,
( ssList(nil)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl11_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f525,plain,
( ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f522,f165]) ).
fof(f165,plain,
ssList(sK3),
inference(cnf_transformation,[],[f142]) ).
fof(f522,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ spl11_6 ),
inference(duplicate_literal_removal,[],[f521]) ).
fof(f521,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ spl11_6 ),
inference(superposition,[],[f517,f192]) ).
fof(f192,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.6GFRtiHnyx/Vampire---4.8_15858',ax84) ).
fof(f517,plain,
( ! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| segmentP(app(sK3,X0),sK2) )
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f516,f164]) ).
fof(f164,plain,
ssList(sK2),
inference(cnf_transformation,[],[f142]) ).
fof(f516,plain,
( ! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK3,X0),sK2) )
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f508,f342]) ).
fof(f342,plain,
( ssList(sK4(sK3,sK2))
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f341]) ).
fof(f341,plain,
( spl11_6
<=> ssList(sK4(sK3,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f508,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK4(sK3,sK2))
| ~ ssList(sK2)
| segmentP(app(sK3,X0),sK2) ),
inference(superposition,[],[f220,f332]) ).
fof(f332,plain,
sK3 = app(sK4(sK3,sK2),sK2),
inference(subsumption_resolution,[],[f331,f165]) ).
fof(f331,plain,
( sK3 = app(sK4(sK3,sK2),sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f322,f164]) ).
fof(f322,plain,
( sK3 = app(sK4(sK3,sK2),sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(resolution,[],[f178,f168]) ).
fof(f168,plain,
rearsegP(sK3,sK2),
inference(cnf_transformation,[],[f142]) ).
fof(f178,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| app(sK4(X0,X1),X1) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK4(X0,X1),X1) = X0
& ssList(sK4(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f145,f146]) ).
fof(f146,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK4(X0,X1),X1) = X0
& ssList(sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6GFRtiHnyx/Vampire---4.8_15858',ax6) ).
fof(f220,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f190]) ).
fof(f190,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1))
& ssList(sK5(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f150,f152,f151]) ).
fof(f151,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6GFRtiHnyx/Vampire---4.8_15858',ax7) ).
fof(f381,plain,
spl11_6,
inference(avatar_contradiction_clause,[],[f380]) ).
fof(f380,plain,
( $false
| spl11_6 ),
inference(subsumption_resolution,[],[f379,f165]) ).
fof(f379,plain,
( ~ ssList(sK3)
| spl11_6 ),
inference(subsumption_resolution,[],[f378,f164]) ).
fof(f378,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| spl11_6 ),
inference(subsumption_resolution,[],[f377,f168]) ).
fof(f377,plain,
( ~ rearsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl11_6 ),
inference(resolution,[],[f343,f177]) ).
fof(f177,plain,
! [X0,X1] :
( ssList(sK4(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f343,plain,
( ~ ssList(sK4(sK3,sK2))
| spl11_6 ),
inference(avatar_component_clause,[],[f341]) ).
fof(f238,plain,
spl11_1,
inference(avatar_split_clause,[],[f191,f225]) ).
fof(f191,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.6GFRtiHnyx/Vampire---4.8_15858',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC373+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 20:34:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.6GFRtiHnyx/Vampire---4.8_15858
% 0.57/0.75 % (16110)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.57/0.75 % (16112)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.57/0.75 % (16107)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.57/0.75 % (16105)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.57/0.75 % (16108)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.57/0.75 % (16109)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.57/0.75 % (16106)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.57/0.75 % (16111)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.57/0.76 % (16107)First to succeed.
% 0.57/0.76 % (16110)Instruction limit reached!
% 0.57/0.76 % (16110)------------------------------
% 0.57/0.76 % (16110)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (16110)Termination reason: Unknown
% 0.57/0.76 % (16110)Termination phase: Saturation
% 0.57/0.76
% 0.57/0.76 % (16110)Memory used [KB]: 1344
% 0.57/0.76 % (16110)Time elapsed: 0.013 s
% 0.57/0.76 % (16110)Instructions burned: 45 (million)
% 0.57/0.76 % (16110)------------------------------
% 0.57/0.76 % (16110)------------------------------
% 0.57/0.76 % (16107)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16101"
% 0.57/0.76 % (16107)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (16107)------------------------------
% 0.57/0.76 % (16107)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (16107)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (16107)Memory used [KB]: 1281
% 0.57/0.76 % (16107)Time elapsed: 0.013 s
% 0.57/0.76 % (16107)Instructions burned: 19 (million)
% 0.57/0.76 % (16101)Success in time 0.391 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------