TSTP Solution File: SWC332+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC332+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:22 EDT 2024
% Result : Theorem 0.64s 0.82s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 69 ( 11 unt; 0 def)
% Number of atoms : 298 ( 56 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 343 ( 114 ~; 109 |; 92 &)
% ( 10 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 34 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f304,plain,
$false,
inference(avatar_sat_refutation,[],[f248,f257,f258,f285,f303]) ).
fof(f303,plain,
( spl15_2
| ~ spl15_3 ),
inference(avatar_contradiction_clause,[],[f302]) ).
fof(f302,plain,
( $false
| spl15_2
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f301,f168]) ).
fof(f168,plain,
ssList(sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(sK3,nil)
| singletonP(sK2) )
& segmentP(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,f137,f136,f135,f134]) ).
fof(f134,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(X1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(X1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(sK2) )
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(X3,nil)
| singletonP(sK2) )
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(sK3,nil)
| singletonP(sK2) )
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(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)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(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)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',co1) ).
fof(f301,plain,
( ~ ssList(sK2)
| spl15_2
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f300,f252]) ).
fof(f252,plain,
( singletonP(sK2)
| ~ spl15_3 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f250,plain,
( spl15_3
<=> singletonP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_3])]) ).
fof(f300,plain,
( ~ singletonP(sK2)
| ~ ssList(sK2)
| spl15_2
| ~ spl15_3 ),
inference(resolution,[],[f296,f181]) ).
fof(f181,plain,
! [X0] :
( ssItem(sK4(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK4(X0),nil) = X0
& ssItem(sK4(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f142,f143]) ).
fof(f143,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK4(X0),nil) = X0
& ssItem(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax4) ).
fof(f296,plain,
( ~ ssItem(sK4(sK2))
| spl15_2
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f292,f247]) ).
fof(f247,plain,
( ~ equalelemsP(sK2)
| spl15_2 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl15_2
<=> equalelemsP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
fof(f292,plain,
( equalelemsP(sK2)
| ~ ssItem(sK4(sK2))
| ~ spl15_3 ),
inference(superposition,[],[f196,f291]) ).
fof(f291,plain,
( sK2 = cons(sK4(sK2),nil)
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f290,f168]) ).
fof(f290,plain,
( sK2 = cons(sK4(sK2),nil)
| ~ ssList(sK2)
| ~ spl15_3 ),
inference(resolution,[],[f182,f252]) ).
fof(f182,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK4(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f196,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,axiom,
! [X0] :
( ssItem(X0)
=> equalelemsP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax73) ).
fof(f285,plain,
( ~ spl15_1
| spl15_2
| spl15_4 ),
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f284,plain,
( $false
| ~ spl15_1
| spl15_2
| spl15_4 ),
inference(subsumption_resolution,[],[f282,f195]) ).
fof(f195,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax74) ).
fof(f282,plain,
( ~ equalelemsP(nil)
| ~ spl15_1
| spl15_2
| spl15_4 ),
inference(backward_demodulation,[],[f247,f280]) ).
fof(f280,plain,
( nil = sK2
| ~ spl15_1
| spl15_4 ),
inference(subsumption_resolution,[],[f279,f168]) ).
fof(f279,plain,
( nil = sK2
| ~ ssList(sK2)
| ~ spl15_1
| spl15_4 ),
inference(resolution,[],[f276,f184]) ).
fof(f184,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax58) ).
fof(f276,plain,
( segmentP(nil,sK2)
| ~ spl15_1
| spl15_4 ),
inference(backward_demodulation,[],[f242,f275]) ).
fof(f275,plain,
( nil = sK3
| spl15_4 ),
inference(subsumption_resolution,[],[f274,f169]) ).
fof(f169,plain,
ssList(sK3),
inference(cnf_transformation,[],[f138]) ).
fof(f274,plain,
( nil = sK3
| ~ ssList(sK3)
| spl15_4 ),
inference(subsumption_resolution,[],[f269,f179]) ).
fof(f179,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax17) ).
fof(f269,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl15_4 ),
inference(resolution,[],[f176,f256]) ).
fof(f256,plain,
( ~ neq(sK3,nil)
| spl15_4 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f254,plain,
( spl15_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_4])]) ).
fof(f176,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261',ax15) ).
fof(f242,plain,
( segmentP(sK3,sK2)
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl15_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
fof(f258,plain,
spl15_1,
inference(avatar_split_clause,[],[f172,f241]) ).
fof(f172,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f257,plain,
( spl15_3
| ~ spl15_4 ),
inference(avatar_split_clause,[],[f173,f254,f250]) ).
fof(f173,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f138]) ).
fof(f248,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f226,f245,f241]) ).
fof(f226,plain,
( ~ equalelemsP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f174,f171,f170,f171]) ).
fof(f170,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f171,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f174,plain,
( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SWC332+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n012.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 : Fri May 3 20:31:23 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.zU3xANQYgq/Vampire---4.8_32261
% 0.64/0.81 % (32456)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 (2995ds/34Mi)
% 0.64/0.81 % (32458)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.64/0.81 % (32457)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 (2995ds/51Mi)
% 0.64/0.81 % (32459)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.64/0.81 % (32460)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 (2995ds/34Mi)
% 0.64/0.81 % (32461)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.64/0.81 % (32462)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 (2995ds/83Mi)
% 0.64/0.81 % (32463)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 (2995ds/56Mi)
% 0.64/0.82 % (32463)Refutation not found, incomplete strategy% (32463)------------------------------
% 0.64/0.82 % (32463)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.82 % (32463)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (32463)Memory used [KB]: 1140
% 0.64/0.82 % (32463)Time elapsed: 0.005 s
% 0.64/0.82 % (32463)Instructions burned: 5 (million)
% 0.64/0.82 % (32463)------------------------------
% 0.64/0.82 % (32463)------------------------------
% 0.64/0.82 % (32458)First to succeed.
% 0.64/0.82 % (32458)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32422"
% 0.64/0.82 % (32458)Refutation found. Thanks to Tanya!
% 0.64/0.82 % SZS status Theorem for Vampire---4
% 0.64/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.64/0.82 % (32458)------------------------------
% 0.64/0.82 % (32458)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.82 % (32458)Termination reason: Refutation
% 0.64/0.82
% 0.64/0.82 % (32458)Memory used [KB]: 1172
% 0.64/0.82 % (32458)Time elapsed: 0.008 s
% 0.64/0.82 % (32458)Instructions burned: 10 (million)
% 0.64/0.82 % (32422)Success in time 0.457 s
% 0.64/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------