TSTP Solution File: SWC294+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC294+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/sandbox2/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:53 EDT 2024
% Result : Theorem 0.52s 0.74s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 68 ( 12 unt; 0 def)
% Number of atoms : 297 ( 66 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 344 ( 115 ~; 107 |; 94 &)
% ( 11 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 43 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f423,plain,
$false,
inference(avatar_sat_refutation,[],[f355,f386,f408,f422]) ).
fof(f422,plain,
( ~ spl23_1
| spl23_3 ),
inference(avatar_contradiction_clause,[],[f421]) ).
fof(f421,plain,
( $false
| ~ spl23_1
| spl23_3 ),
inference(subsumption_resolution,[],[f420,f224]) ).
fof(f224,plain,
ssList(sK2),
inference(cnf_transformation,[],[f175]) ).
fof(f175,plain,
( ( ~ neq(sK3,nil)
| singletonP(sK2) )
& ~ strictorderedP(sK0)
& 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])],[f98,f174,f173,f172,f171]) ).
fof(f171,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK0)
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK0)
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK0)
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK0)
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK2) )
& ~ strictorderedP(sK0)
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK2) )
& ~ strictorderedP(sK0)
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| singletonP(sK2) )
& ~ strictorderedP(sK0)
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& 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] :
( ( neq(X3,nil)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f420,plain,
( ~ ssList(sK2)
| ~ spl23_1
| spl23_3 ),
inference(subsumption_resolution,[],[f419,f350]) ).
fof(f350,plain,
( singletonP(sK2)
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f348,plain,
( spl23_1
<=> singletonP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f419,plain,
( ~ singletonP(sK2)
| ~ ssList(sK2)
| spl23_3 ),
inference(resolution,[],[f401,f237]) ).
fof(f237,plain,
! [X0] :
( ssItem(sK4(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f181,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])],[f179,f180]) ).
fof(f180,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK4(X0),nil) = X0
& ssItem(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f179,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f178]) ).
fof(f178,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,[],[f101]) ).
fof(f101,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/benchmark/theBenchmark.p',ax4) ).
fof(f401,plain,
( ~ ssItem(sK4(sK2))
| spl23_3 ),
inference(avatar_component_clause,[],[f399]) ).
fof(f399,plain,
( spl23_3
<=> ssItem(sK4(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_3])]) ).
fof(f408,plain,
( ~ spl23_3
| ~ spl23_1 ),
inference(avatar_split_clause,[],[f407,f348,f399]) ).
fof(f407,plain,
( ~ ssItem(sK4(sK2))
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f394,f326]) ).
fof(f326,plain,
~ strictorderedP(sK2),
inference(definition_unfolding,[],[f229,f227]) ).
fof(f227,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f175]) ).
fof(f229,plain,
~ strictorderedP(sK0),
inference(cnf_transformation,[],[f175]) ).
fof(f394,plain,
( strictorderedP(sK2)
| ~ ssItem(sK4(sK2))
| ~ spl23_1 ),
inference(superposition,[],[f357,f392]) ).
fof(f392,plain,
( sK2 = cons(sK4(sK2),nil)
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f391,f224]) ).
fof(f391,plain,
( sK2 = cons(sK4(sK2),nil)
| ~ ssList(sK2)
| ~ spl23_1 ),
inference(resolution,[],[f238,f350]) ).
fof(f238,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK4(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f357,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f334,f235]) ).
fof(f235,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f334,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f254]) ).
fof(f254,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f189]) ).
fof(f189,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f188]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(f386,plain,
spl23_2,
inference(avatar_contradiction_clause,[],[f385]) ).
fof(f385,plain,
( $false
| spl23_2 ),
inference(subsumption_resolution,[],[f384,f256]) ).
fof(f256,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f384,plain,
( ~ strictorderedP(nil)
| spl23_2 ),
inference(backward_demodulation,[],[f326,f381]) ).
fof(f381,plain,
( nil = sK2
| spl23_2 ),
inference(subsumption_resolution,[],[f380,f224]) ).
fof(f380,plain,
( nil = sK2
| ~ ssList(sK2)
| spl23_2 ),
inference(resolution,[],[f377,f240]) ).
fof(f240,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f182,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,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/benchmark/theBenchmark.p',ax58) ).
fof(f377,plain,
( segmentP(nil,sK2)
| spl23_2 ),
inference(backward_demodulation,[],[f228,f374]) ).
fof(f374,plain,
( nil = sK3
| spl23_2 ),
inference(subsumption_resolution,[],[f373,f225]) ).
fof(f225,plain,
ssList(sK3),
inference(cnf_transformation,[],[f175]) ).
fof(f373,plain,
( nil = sK3
| ~ ssList(sK3)
| spl23_2 ),
inference(subsumption_resolution,[],[f368,f235]) ).
fof(f368,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl23_2 ),
inference(resolution,[],[f232,f354]) ).
fof(f354,plain,
( ~ neq(sK3,nil)
| spl23_2 ),
inference(avatar_component_clause,[],[f352]) ).
fof(f352,plain,
( spl23_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_2])]) ).
fof(f232,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,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/benchmark/theBenchmark.p',ax15) ).
fof(f228,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f175]) ).
fof(f355,plain,
( spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f230,f352,f348]) ).
fof(f230,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC294+1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.10 % 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.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 02:46:53 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.30 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/benchmark/theBenchmark.p
% 0.52/0.73 % (10141)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 (2995ds/34Mi)
% 0.52/0.73 % (10145)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 (2995ds/34Mi)
% 0.52/0.73 % (10143)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.52/0.73 % (10144)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.52/0.73 % (10147)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 (2995ds/83Mi)
% 0.52/0.73 % (10142)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 (2995ds/51Mi)
% 0.52/0.73 % (10143)First to succeed.
% 0.52/0.73 % (10143)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10140"
% 0.52/0.73 % (10146)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.52/0.74 % (10143)Refutation found. Thanks to Tanya!
% 0.52/0.74 % SZS status Theorem for theBenchmark
% 0.52/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.74 % (10143)------------------------------
% 0.52/0.74 % (10143)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (10143)Termination reason: Refutation
% 0.52/0.74
% 0.52/0.74 % (10143)Memory used [KB]: 1326
% 0.52/0.74 % (10143)Time elapsed: 0.008 s
% 0.52/0.74 % (10143)Instructions burned: 14 (million)
% 0.52/0.74 % (10140)Success in time 0.423 s
% 0.52/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------