TSTP Solution File: SWC214+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC214+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 : n029.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:11 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 22
% Syntax : Number of formulae : 121 ( 14 unt; 0 def)
% Number of atoms : 613 ( 112 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 824 ( 332 ~; 314 |; 134 &)
% ( 7 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 190 ( 154 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f837,plain,
$false,
inference(avatar_sat_refutation,[],[f728,f765,f811,f834]) ).
fof(f834,plain,
( spl23_1
| spl23_4 ),
inference(avatar_contradiction_clause,[],[f833]) ).
fof(f833,plain,
( $false
| spl23_1
| spl23_4 ),
inference(subsumption_resolution,[],[f832,f239]) ).
fof(f239,plain,
ssList(sK3),
inference(cnf_transformation,[],[f186]) ).
fof(f186,plain,
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f185,f184,f183,f182]) ).
fof(f182,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f183,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(X3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f185,plain,
( ? [X3] :
( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(X3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& 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)
=> ( neq(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ 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(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f832,plain,
( ~ ssList(sK3)
| spl23_1
| spl23_4 ),
inference(subsumption_resolution,[],[f830,f498]) ).
fof(f498,plain,
( nil != sK3
| spl23_1 ),
inference(avatar_component_clause,[],[f497]) ).
fof(f497,plain,
( spl23_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f830,plain,
( nil = sK3
| ~ ssList(sK3)
| spl23_4 ),
inference(resolution,[],[f803,f296]) ).
fof(f296,plain,
! [X0] :
( ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f217,plain,
! [X0] :
( ( cons(sK15(X0),sK14(X0)) = X0
& ssItem(sK15(X0))
& ssList(sK14(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f129,f216,f215]) ).
fof(f215,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK14(X0)) = X0
& ssItem(X2) )
& ssList(sK14(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f216,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK14(X0)) = X0
& ssItem(X2) )
=> ( cons(sK15(X0),sK14(X0)) = X0
& ssItem(sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f803,plain,
( ~ ssItem(sK15(sK3))
| spl23_4 ),
inference(avatar_component_clause,[],[f801]) ).
fof(f801,plain,
( spl23_4
<=> ssItem(sK15(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_4])]) ).
fof(f811,plain,
( ~ spl23_4
| ~ spl23_3 ),
inference(avatar_split_clause,[],[f810,f725,f801]) ).
fof(f725,plain,
( spl23_3
<=> nil = cons(sK15(sK3),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_3])]) ).
fof(f810,plain,
( ~ ssItem(sK15(sK3))
| ~ spl23_3 ),
inference(subsumption_resolution,[],[f796,f251]) ).
fof(f251,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f796,plain,
( ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| ~ spl23_3 ),
inference(trivial_inequality_removal,[],[f792]) ).
fof(f792,plain,
( nil != nil
| ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| ~ spl23_3 ),
inference(superposition,[],[f300,f727]) ).
fof(f727,plain,
( nil = cons(sK15(sK3),nil)
| ~ spl23_3 ),
inference(avatar_component_clause,[],[f725]) ).
fof(f300,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f765,plain,
~ spl23_1,
inference(avatar_contradiction_clause,[],[f764]) ).
fof(f764,plain,
( $false
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f731,f407]) ).
fof(f407,plain,
~ neq(nil,nil),
inference(backward_demodulation,[],[f351,f402]) ).
fof(f402,plain,
nil = sK2,
inference(subsumption_resolution,[],[f401,f238]) ).
fof(f238,plain,
ssList(sK2),
inference(cnf_transformation,[],[f186]) ).
fof(f401,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f396,f251]) ).
fof(f396,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f248,f351]) ).
fof(f248,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f187]) ).
fof(f187,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/benchmark/theBenchmark.p',ax15) ).
fof(f351,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f246,f241]) ).
fof(f241,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f186]) ).
fof(f246,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f186]) ).
fof(f731,plain,
( neq(nil,nil)
| ~ spl23_1 ),
inference(backward_demodulation,[],[f352,f499]) ).
fof(f499,plain,
( nil = sK3
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f497]) ).
fof(f352,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f242,f240]) ).
fof(f240,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f186]) ).
fof(f242,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f186]) ).
fof(f728,plain,
( spl23_1
| spl23_3 ),
inference(avatar_split_clause,[],[f723,f725,f497]) ).
fof(f723,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3 ),
inference(subsumption_resolution,[],[f722,f239]) ).
fof(f722,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f719]) ).
fof(f719,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(sK3) ),
inference(resolution,[],[f696,f259]) ).
fof(f259,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f696,plain,
! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f695,f296]) ).
fof(f695,plain,
! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f690,f295]) ).
fof(f295,plain,
! [X0] :
( ssList(sK14(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f690,plain,
! [X0] :
( ~ frontsegP(sK3,X0)
| ~ ssList(sK14(X0))
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f671,f297]) ).
fof(f297,plain,
! [X0] :
( cons(sK15(X0),sK14(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f671,plain,
! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f669]) ).
fof(f669,plain,
! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f651,f307]) ).
fof(f307,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f651,plain,
! [X0,X1] :
( ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f650,f251]) ).
fof(f650,plain,
! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f649]) ).
fof(f649,plain,
! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f642,f301]) ).
fof(f301,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f642,plain,
! [X0,X1] :
( ~ ssList(cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f638]) ).
fof(f638,plain,
! [X0,X1] :
( ~ ssItem(X0)
| nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil)) ),
inference(resolution,[],[f637,f259]) ).
fof(f637,plain,
! [X2,X0,X1] :
( ~ frontsegP(X1,cons(X0,nil))
| ~ ssItem(X0)
| nil = cons(X0,nil)
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f636,f251]) ).
fof(f636,plain,
! [X2,X0,X1] :
( nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ frontsegP(X1,cons(X0,nil))
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f635]) ).
fof(f635,plain,
! [X2,X0,X1] :
( nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ frontsegP(X1,cons(X0,nil))
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f615,f301]) ).
fof(f615,plain,
! [X2,X0,X1] :
( ~ ssList(cons(X2,nil))
| nil = cons(X2,nil)
| ~ ssItem(X2)
| ~ frontsegP(X0,cons(X2,nil))
| ~ ssList(X1)
| ~ frontsegP(sK3,app(X0,X1))
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f612,f312]) ).
fof(f312,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f612,plain,
! [X2,X0,X1] :
( ~ frontsegP(sK3,app(X0,X1))
| ~ ssList(app(X0,X1))
| nil = cons(X2,nil)
| ~ ssItem(X2)
| ~ frontsegP(X0,cons(X2,nil))
| ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| ~ ssList(X0) ),
inference(resolution,[],[f595,f258]) ).
fof(f258,plain,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X0,X1)
=> frontsegP(app(X0,X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax43) ).
fof(f595,plain,
! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) ),
inference(subsumption_resolution,[],[f594,f251]) ).
fof(f594,plain,
! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f593]) ).
fof(f593,plain,
! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(resolution,[],[f579,f301]) ).
fof(f579,plain,
! [X0,X1] :
( ~ ssList(cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) ),
inference(subsumption_resolution,[],[f576,f239]) ).
fof(f576,plain,
! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(sK3)
| nil = cons(X1,nil)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f569]) ).
fof(f569,plain,
! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(sK3)
| ~ ssList(cons(X1,nil))
| nil = cons(X1,nil)
| ~ ssItem(X1) ),
inference(resolution,[],[f261,f415]) ).
fof(f415,plain,
! [X0] :
( ~ frontsegP(sK3,cons(X0,nil))
| ~ ssList(cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssItem(X0) ),
inference(resolution,[],[f414,f378]) ).
fof(f378,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f362,f251]) ).
fof(f362,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f279]) ).
fof(f279,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f203,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,[],[f202]) ).
fof(f202,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,[],[f123]) ).
fof(f123,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(f414,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(subsumption_resolution,[],[f413,f251]) ).
fof(f413,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f412]) ).
fof(f412,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f409,f248]) ).
fof(f409,plain,
! [X4] :
( ~ neq(nil,X4)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) ),
inference(subsumption_resolution,[],[f408,f267]) ).
fof(f267,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f408,plain,
! [X4] :
( ~ segmentP(X4,nil)
| ~ neq(nil,X4)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f406,f402]) ).
fof(f406,plain,
! [X4] :
( ~ neq(nil,X4)
| ~ segmentP(X4,sK2)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) ),
inference(backward_demodulation,[],[f245,f402]) ).
fof(f245,plain,
! [X4] :
( ~ segmentP(X4,sK2)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f186]) ).
fof(f261,plain,
! [X2,X0,X1] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f40,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X0,X1) )
=> frontsegP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC214+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:34:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/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/benchmark/theBenchmark.p
% 0.52/0.73 % (24608)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.52/0.73 % (24601)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.52/0.73 % (24604)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.52/0.73 % (24603)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73 % (24602)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.52/0.73 % (24605)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.52/0.73 % (24606)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.52/0.73 % (24607)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.52/0.73 % (24608)Refutation not found, incomplete strategy% (24608)------------------------------
% 0.52/0.73 % (24608)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73 % (24608)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.73
% 0.52/0.73 % (24608)Memory used [KB]: 1167
% 0.52/0.73 % (24608)Time elapsed: 0.003 s
% 0.52/0.73 % (24608)Instructions burned: 7 (million)
% 0.52/0.73 % (24608)------------------------------
% 0.52/0.73 % (24608)------------------------------
% 0.52/0.73 % (24609)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.57/0.75 % (24604)Instruction limit reached!
% 0.57/0.75 % (24604)------------------------------
% 0.57/0.75 % (24604)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (24604)Termination reason: Unknown
% 0.57/0.75 % (24604)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (24604)Memory used [KB]: 1718
% 0.57/0.75 % (24604)Time elapsed: 0.018 s
% 0.57/0.75 % (24604)Instructions burned: 33 (million)
% 0.57/0.75 % (24604)------------------------------
% 0.57/0.75 % (24604)------------------------------
% 0.57/0.75 % (24605)Instruction limit reached!
% 0.57/0.75 % (24605)------------------------------
% 0.57/0.75 % (24605)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (24605)Termination reason: Unknown
% 0.57/0.75 % (24605)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (24605)Memory used [KB]: 2006
% 0.57/0.75 % (24605)Time elapsed: 0.020 s
% 0.57/0.75 % (24605)Instructions burned: 34 (million)
% 0.57/0.75 % (24605)------------------------------
% 0.57/0.75 % (24605)------------------------------
% 0.57/0.75 % (24609)Instruction limit reached!
% 0.57/0.75 % (24609)------------------------------
% 0.57/0.75 % (24609)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (24609)Termination reason: Unknown
% 0.57/0.75 % (24609)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (24609)Memory used [KB]: 2160
% 0.57/0.75 % (24609)Time elapsed: 0.017 s
% 0.57/0.75 % (24609)Instructions burned: 55 (million)
% 0.57/0.75 % (24609)------------------------------
% 0.57/0.75 % (24609)------------------------------
% 0.57/0.75 % (24601)Instruction limit reached!
% 0.57/0.75 % (24601)------------------------------
% 0.57/0.75 % (24601)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (24601)Termination reason: Unknown
% 0.57/0.75 % (24601)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (24601)Memory used [KB]: 1579
% 0.57/0.75 % (24601)Time elapsed: 0.022 s
% 0.57/0.75 % (24601)Instructions burned: 35 (million)
% 0.57/0.75 % (24601)------------------------------
% 0.57/0.75 % (24601)------------------------------
% 0.57/0.75 % (24610)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.57/0.75 % (24606)Instruction limit reached!
% 0.57/0.75 % (24606)------------------------------
% 0.57/0.75 % (24606)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (24606)Termination reason: Unknown
% 0.57/0.75 % (24606)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (24606)Memory used [KB]: 1559
% 0.57/0.75 % (24606)Time elapsed: 0.023 s
% 0.57/0.75 % (24606)Instructions burned: 46 (million)
% 0.57/0.75 % (24606)------------------------------
% 0.57/0.75 % (24606)------------------------------
% 0.57/0.75 % (24613)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.57/0.75 % (24611)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.57/0.75 % (24603)First to succeed.
% 0.57/0.75 % (24612)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.57/0.75 % (24603)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24600"
% 0.57/0.75 % (24614)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2996ds/42Mi)
% 0.57/0.76 % (24603)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for theBenchmark
% 0.57/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.76 % (24603)------------------------------
% 0.57/0.76 % (24603)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (24603)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (24603)Memory used [KB]: 1418
% 0.57/0.76 % (24603)Time elapsed: 0.027 s
% 0.57/0.76 % (24603)Instructions burned: 44 (million)
% 0.57/0.76 % (24600)Success in time 0.394 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------