TSTP Solution File: SWC239+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC239+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 : n027.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:49:39 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 9 unt; 0 def)
% Number of atoms : 477 ( 147 equ)
% Maximal formula atoms : 50 ( 8 avg)
% Number of connectives : 639 ( 218 ~; 189 |; 202 &)
% ( 3 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 158 ( 100 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f300,plain,
$false,
inference(avatar_sat_refutation,[],[f262,f267,f276,f299]) ).
fof(f299,plain,
( ~ spl12_4
| ~ spl12_5 ),
inference(avatar_contradiction_clause,[],[f298]) ).
fof(f298,plain,
( $false
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f297,f166]) ).
fof(f166,plain,
ssList(sK2),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ( ~ leq(X6,sK5(X6,X7,X8))
& lt(X6,sK5(X6,X7,X8))
& memberP(X8,sK5(X6,X7,X8))
& memberP(X7,sK5(X6,X7,X8))
& ssItem(sK5(X6,X7,X8)) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& 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,f143,f142,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X6,X7,X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
=> ( ~ leq(X6,sK5(X6,X7,X8))
& lt(X6,sK5(X6,X7,X8))
& memberP(X8,sK5(X6,X7,X8))
& memberP(X7,sK5(X6,X7,X8))
& ssItem(sK5(X6,X7,X8)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ! [X9] :
( ssItem(X9)
=> ( leq(X6,X9)
| ~ lt(X6,X9)
| ~ memberP(X8,X9)
| ~ memberP(X7,X9) ) )
& app(app(X7,cons(X6,nil)),X8) = X0
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X8] :
( ssItem(X8)
=> ( ? [X9] :
( leq(X8,X9)
& memberP(X3,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X3,X8)
| cons(X8,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X8] :
( ssItem(X8)
=> ( ? [X9] :
( leq(X8,X9)
& memberP(X3,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X3,X8)
| cons(X8,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OsqkNr4unb/Vampire---4.8_3891',co1) ).
fof(f297,plain,
( ~ ssList(sK2)
| ~ spl12_4
| ~ spl12_5 ),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f296,plain,
( sK2 != sK2
| ~ ssList(sK2)
| ~ spl12_4
| ~ spl12_5 ),
inference(superposition,[],[f294,f195]) ).
fof(f195,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,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/sandbox2/tmp/tmp.OsqkNr4unb/Vampire---4.8_3891',ax84) ).
fof(f294,plain,
( sK2 != app(sK2,nil)
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f293,f206]) ).
fof(f206,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.OsqkNr4unb/Vampire---4.8_3891',ax17) ).
fof(f293,plain,
( sK2 != app(sK2,nil)
| ~ ssList(nil)
| ~ spl12_4
| ~ spl12_5 ),
inference(superposition,[],[f287,f290]) ).
fof(f290,plain,
sK2 = app(nil,sK2),
inference(resolution,[],[f203,f166]) ).
fof(f203,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.OsqkNr4unb/Vampire---4.8_3891',ax28) ).
fof(f287,plain,
( ! [X0] :
( sK2 != app(app(X0,sK2),nil)
| ~ ssList(X0) )
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f286,f266]) ).
fof(f266,plain,
( ssItem(sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f264,plain,
( spl12_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f286,plain,
( ! [X0] :
( sK2 != app(app(X0,sK2),nil)
| ~ ssList(X0)
| ~ ssItem(sK4) )
| ~ spl12_4 ),
inference(superposition,[],[f285,f261]) ).
fof(f261,plain,
( sK2 = cons(sK4,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f259,plain,
( spl12_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f285,plain,
! [X0,X1] :
( sK2 != app(app(X0,cons(X1,nil)),nil)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(subsumption_resolution,[],[f284,f206]) ).
fof(f284,plain,
! [X0,X1] :
( sK2 != app(app(X0,cons(X1,nil)),nil)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f283]) ).
fof(f283,plain,
! [X0,X1] :
( sK2 != app(app(X0,cons(X1,nil)),nil)
| ~ ssList(X0)
| ~ ssItem(X1)
| sK2 != app(app(X0,cons(X1,nil)),nil)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(resolution,[],[f279,f233]) ).
fof(f233,plain,
! [X8,X6,X7] :
( ssItem(sK5(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK2
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f171,f169]) ).
fof(f169,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f171,plain,
! [X8,X6,X7] :
( ssItem(sK5(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f144]) ).
fof(f279,plain,
! [X0,X1] :
( ~ ssItem(sK5(X0,X1,nil))
| sK2 != app(app(X1,cons(X0,nil)),nil)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f277,f206]) ).
fof(f277,plain,
! [X0,X1] :
( ~ ssItem(sK5(X0,X1,nil))
| sK2 != app(app(X1,cons(X0,nil)),nil)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(resolution,[],[f207,f231]) ).
fof(f231,plain,
! [X8,X6,X7] :
( memberP(X8,sK5(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK2
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f173,f169]) ).
fof(f173,plain,
! [X8,X6,X7] :
( memberP(X8,sK5(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK0
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f144]) ).
fof(f207,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.OsqkNr4unb/Vampire---4.8_3891',ax38) ).
fof(f276,plain,
~ spl12_2,
inference(avatar_split_clause,[],[f234,f249]) ).
fof(f249,plain,
( spl12_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f234,plain,
nil != sK2,
inference(definition_unfolding,[],[f170,f169]) ).
fof(f170,plain,
nil != sK0,
inference(cnf_transformation,[],[f144]) ).
fof(f267,plain,
( spl12_5
| spl12_2 ),
inference(avatar_split_clause,[],[f180,f249,f264]) ).
fof(f180,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f262,plain,
( spl12_4
| spl12_2 ),
inference(avatar_split_clause,[],[f181,f249,f259]) ).
fof(f181,plain,
( nil = sK2
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC239+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/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.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 20:26:53 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.OsqkNr4unb/Vampire---4.8_3891
% 0.60/0.80 % (4063)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.60/0.80 % (4066)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.60/0.80 % (4065)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.60/0.80 % (4064)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.60/0.80 % (4067)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.60/0.80 % (4068)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.60/0.80 % (4069)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.60/0.80 % (4070)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.60/0.81 % (4065)First to succeed.
% 0.60/0.81 % (4065)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4062"
% 0.60/0.81 % (4065)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (4065)------------------------------
% 0.60/0.81 % (4065)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (4065)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (4065)Memory used [KB]: 1179
% 0.60/0.81 % (4065)Time elapsed: 0.009 s
% 0.60/0.81 % (4065)Instructions burned: 12 (million)
% 0.60/0.81 % (4062)Success in time 0.438 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------