TSTP Solution File: SWC339+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC339+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/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 : Tue May 21 04:38:17 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 557 ( 162 equ)
% Maximal formula atoms : 56 ( 12 avg)
% Number of connectives : 823 ( 310 ~; 271 |; 210 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 10 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 249 ( 165 !; 84 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f366,plain,
$false,
inference(avatar_sat_refutation,[],[f268,f278,f362]) ).
fof(f362,plain,
spl18_1,
inference(avatar_contradiction_clause,[],[f361]) ).
fof(f361,plain,
( $false
| spl18_1 ),
inference(subsumption_resolution,[],[f360,f181]) ).
fof(f181,plain,
ssList(sK3),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != sK2
| nil = sK3 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f150,f149,f148,f147,f146,f145]) ).
fof(f145,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(X1,sK0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(X1,sK0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& 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)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X2
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X4
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f360,plain,
( ~ ssList(sK3)
| spl18_1 ),
inference(subsumption_resolution,[],[f359,f180]) ).
fof(f180,plain,
ssList(sK2),
inference(cnf_transformation,[],[f151]) ).
fof(f359,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| spl18_1 ),
inference(subsumption_resolution,[],[f358,f184]) ).
fof(f184,plain,
ssList(sK4),
inference(cnf_transformation,[],[f151]) ).
fof(f358,plain,
( ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl18_1 ),
inference(subsumption_resolution,[],[f357,f185]) ).
fof(f185,plain,
ssList(sK5),
inference(cnf_transformation,[],[f151]) ).
fof(f357,plain,
( ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl18_1 ),
inference(subsumption_resolution,[],[f295,f263]) ).
fof(f263,plain,
( ~ segmentP(sK3,sK2)
| spl18_1 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl18_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_1])]) ).
fof(f295,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f255,f186]) ).
fof(f186,plain,
sK3 = app(app(sK4,sK2),sK5),
inference(cnf_transformation,[],[f151]) ).
fof(f255,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f225]) ).
fof(f225,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,[],[f165]) ).
fof(f165,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1))
& ssList(sK10(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f162,f164,f163]) ).
fof(f163,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f162,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,[],[f161]) ).
fof(f161,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,[],[f128]) ).
fof(f128,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/benchmark/theBenchmark.p',ax7) ).
fof(f278,plain,
spl18_2,
inference(avatar_split_clause,[],[f187,f265]) ).
fof(f265,plain,
( spl18_2
<=> totalorderedP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).
fof(f187,plain,
totalorderedP(sK2),
inference(cnf_transformation,[],[f151]) ).
fof(f268,plain,
( ~ spl18_1
| ~ spl18_2 ),
inference(avatar_split_clause,[],[f249,f265,f261]) ).
fof(f249,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f191,f183,f182,f183]) ).
fof(f182,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f151]) ).
fof(f183,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f151]) ).
fof(f191,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC339+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/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.14/0.35 % Computer : n024.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 : Sun May 19 03:04:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/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/benchmark/theBenchmark.p
% 0.56/0.75 % (6455)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.56/0.75 % (6449)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.56/0.75 % (6450)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.56/0.75 % (6451)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75 % (6452)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.56/0.75 % (6454)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.56/0.75 % (6456)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.56/0.75 % (6453)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.56/0.75 % (6454)First to succeed.
% 0.56/0.75 % (6454)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6445"
% 0.56/0.76 % (6454)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for theBenchmark
% 0.56/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.76 % (6454)------------------------------
% 0.56/0.76 % (6454)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (6454)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (6454)Memory used [KB]: 1274
% 0.56/0.76 % (6454)Time elapsed: 0.008 s
% 0.56/0.76 % (6454)Instructions burned: 12 (million)
% 0.56/0.76 % (6445)Success in time 0.385 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------