TSTP Solution File: SWC311+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC311+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 : n020.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:02 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of formulae : 118 ( 8 unt; 0 def)
% Number of atoms : 710 ( 262 equ)
% Maximal formula atoms : 54 ( 6 avg)
% Number of connectives : 996 ( 404 ~; 399 |; 147 &)
% ( 16 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 15 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 180 ( 138 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f864,plain,
$false,
inference(avatar_sat_refutation,[],[f600,f605,f606,f631,f632,f640,f648,f664,f666,f673,f675,f707,f801,f835,f838,f863]) ).
fof(f863,plain,
( ~ spl51_8
| ~ spl51_10
| ~ spl51_4
| ~ spl51_7
| ~ spl51_12 ),
inference(avatar_split_clause,[],[f862,f655,f612,f598,f624,f616]) ).
fof(f616,plain,
( spl51_8
<=> ssList(tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_8])]) ).
fof(f624,plain,
( spl51_10
<=> ssItem(hd(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_10])]) ).
fof(f598,plain,
( spl51_4
<=> ! [X4,X5] :
( app(X5,cons(X4,nil)) != sK49
| ~ ssItem(X4)
| ~ ssList(X5)
| app(cons(X4,nil),X5) != sK50 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_4])]) ).
fof(f612,plain,
( spl51_7
<=> sK49 = app(tl(sK50),cons(hd(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).
fof(f655,plain,
( spl51_12
<=> sK50 = app(cons(hd(sK50),nil),tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_12])]) ).
fof(f862,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| ~ spl51_4
| ~ spl51_7
| ~ spl51_12 ),
inference(trivial_inequality_removal,[],[f861]) ).
fof(f861,plain,
( sK49 != sK49
| ~ ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| ~ spl51_4
| ~ spl51_7
| ~ spl51_12 ),
inference(forward_demodulation,[],[f860,f614]) ).
fof(f614,plain,
( sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f860,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_4
| ~ spl51_12 ),
inference(trivial_inequality_removal,[],[f856]) ).
fof(f856,plain,
( sK50 != sK50
| ~ ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_4
| ~ spl51_12 ),
inference(superposition,[],[f599,f656]) ).
fof(f656,plain,
( sK50 = app(cons(hd(sK50),nil),tl(sK50))
| ~ spl51_12 ),
inference(avatar_component_clause,[],[f655]) ).
fof(f599,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK50
| ~ ssItem(X4)
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK49 )
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f598]) ).
fof(f838,plain,
( ~ spl51_13
| spl51_3
| spl51_25 ),
inference(avatar_split_clause,[],[f837,f832,f594,f661]) ).
fof(f661,plain,
( spl51_13
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_13])]) ).
fof(f594,plain,
( spl51_3
<=> nil = sK50 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_3])]) ).
fof(f832,plain,
( spl51_25
<=> sK50 = cons(hd(sK50),tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_25])]) ).
fof(f837,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_25 ),
inference(trivial_inequality_removal,[],[f836]) ).
fof(f836,plain,
( sK50 != sK50
| nil = sK50
| ~ ssList(sK50)
| spl51_25 ),
inference(superposition,[],[f834,f505]) ).
fof(f505,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f834,plain,
( sK50 != cons(hd(sK50),tl(sK50))
| spl51_25 ),
inference(avatar_component_clause,[],[f832]) ).
fof(f835,plain,
( ~ spl51_8
| ~ spl51_10
| ~ spl51_25
| spl51_12 ),
inference(avatar_split_clause,[],[f826,f655,f832,f624,f616]) ).
fof(f826,plain,
( sK50 != cons(hd(sK50),tl(sK50))
| ~ ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| spl51_12 ),
inference(superposition,[],[f657,f508]) ).
fof(f508,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f199,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/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f657,plain,
( sK50 != app(cons(hd(sK50),nil),tl(sK50))
| spl51_12 ),
inference(avatar_component_clause,[],[f655]) ).
fof(f801,plain,
( ~ spl51_13
| spl51_3
| spl51_10 ),
inference(avatar_split_clause,[],[f800,f624,f594,f661]) ).
fof(f800,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_10 ),
inference(resolution,[],[f626,f428]) ).
fof(f428,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f626,plain,
( ~ ssItem(hd(sK50))
| spl51_10 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f707,plain,
( ~ spl51_14
| ~ spl51_13
| spl51_3
| spl51_11 ),
inference(avatar_split_clause,[],[f704,f628,f594,f661,f670]) ).
fof(f670,plain,
( spl51_14
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_14])]) ).
fof(f628,plain,
( spl51_11
<=> neq(nil,sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_11])]) ).
fof(f704,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ ssList(nil)
| spl51_11 ),
inference(resolution,[],[f418,f630]) ).
fof(f630,plain,
( ~ neq(nil,sK50)
| spl51_11 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f418,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f305]) ).
fof(f305,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,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/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f675,plain,
spl51_14,
inference(avatar_contradiction_clause,[],[f674]) ).
fof(f674,plain,
( $false
| spl51_14 ),
inference(resolution,[],[f672,f420]) ).
fof(f420,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f672,plain,
( ~ ssList(nil)
| spl51_14 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f673,plain,
( ~ spl51_14
| ~ spl51_10
| spl51_9 ),
inference(avatar_split_clause,[],[f668,f620,f624,f670]) ).
fof(f620,plain,
( spl51_9
<=> ssList(cons(hd(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).
fof(f668,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_9 ),
inference(resolution,[],[f622,f419]) ).
fof(f419,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,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/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f622,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_9 ),
inference(avatar_component_clause,[],[f620]) ).
fof(f666,plain,
spl51_13,
inference(avatar_contradiction_clause,[],[f665]) ).
fof(f665,plain,
( $false
| spl51_13 ),
inference(resolution,[],[f663,f530]) ).
fof(f530,plain,
ssList(sK50),
inference(cnf_transformation,[],[f336]) ).
fof(f336,plain,
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(sK50,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK50)
| ! [X9] :
( ~ neq(nil,sK50)
| hd(sK50) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK49 = X6
| ~ ssList(X6) ) )
& ( nil != sK50
| nil = sK49 )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50])],[f223,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK47
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK47
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK49 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = sK49 )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK49 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = sK49 )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK48,nil) )
| ( nil != sK47
& nil = sK48 ) )
& ( ~ neq(sK50,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK50)
| ! [X9] :
( ~ neq(nil,sK50)
| hd(sK50) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK49 = X6
| ~ ssList(X6) ) )
& ( nil != sK50
| nil = sK49 )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& 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)
=> ( ( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X3)
& ? [X9] :
( neq(nil,X3)
& hd(X3) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X3) = X7
& ssList(X8) )
& ssList(X7) )
& X2 != X6
& ssList(X6) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( ? [X9] :
( app(X9,cons(X8,nil)) = X0
& app(cons(X8,nil),X9) = X1
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( ? [X9] :
( app(X9,cons(X8,nil)) = X0
& app(cons(X8,nil),X9) = X1
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f663,plain,
( ~ ssList(sK50)
| spl51_13 ),
inference(avatar_component_clause,[],[f661]) ).
fof(f664,plain,
( ~ spl51_13
| spl51_3
| spl51_8 ),
inference(avatar_split_clause,[],[f659,f616,f594,f661]) ).
fof(f659,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_8 ),
inference(resolution,[],[f618,f430]) ).
fof(f430,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f618,plain,
( ~ ssList(tl(sK50))
| spl51_8 ),
inference(avatar_component_clause,[],[f616]) ).
fof(f648,plain,
( ~ spl51_8
| ~ spl51_9
| spl51_6 ),
inference(avatar_split_clause,[],[f643,f608,f620,f616]) ).
fof(f608,plain,
( spl51_6
<=> ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).
fof(f643,plain,
( ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| spl51_6 ),
inference(resolution,[],[f432,f610]) ).
fof(f610,plain,
( ~ ssList(app(tl(sK50),cons(hd(sK50),nil)))
| spl51_6 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f432,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,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/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f640,plain,
( ~ spl51_3
| ~ spl51_5 ),
inference(avatar_contradiction_clause,[],[f639]) ).
fof(f639,plain,
( $false
| ~ spl51_3
| ~ spl51_5 ),
inference(resolution,[],[f638,f420]) ).
fof(f638,plain,
( ~ ssList(nil)
| ~ spl51_3
| ~ spl51_5 ),
inference(resolution,[],[f581,f636]) ).
fof(f636,plain,
( neq(nil,nil)
| ~ spl51_3
| ~ spl51_5 ),
inference(superposition,[],[f604,f596]) ).
fof(f596,plain,
( nil = sK50
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f594]) ).
fof(f604,plain,
( neq(sK50,nil)
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f602]) ).
fof(f602,plain,
( spl51_5
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).
fof(f581,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f559]) ).
fof(f559,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f417]) ).
fof(f417,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f305]) ).
fof(f632,plain,
( spl51_1
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f533,f594,f586]) ).
fof(f586,plain,
( spl51_1
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f533,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f336]) ).
fof(f631,plain,
( ~ spl51_6
| spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f576,f602,f628,f624,f620,f616,f612,f608]) ).
fof(f576,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(duplicate_literal_removal,[],[f575]) ).
fof(f575,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f574]) ).
fof(f574,plain,
! [X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| tl(sK50) != X7
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X7)
| sK49 = app(X7,cons(hd(sK50),nil))
| ~ ssList(app(X7,cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f573]) ).
fof(f573,plain,
! [X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| app(X7,cons(hd(sK50),nil)) != X6
| tl(sK50) != X7
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X7)
| sK49 = X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f572]) ).
fof(f572,plain,
! [X8,X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X8
| ~ ssItem(hd(sK50))
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK49 = X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f534]) ).
fof(f534,plain,
! [X8,X6,X9,X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| hd(sK50) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9)
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK49 = X6
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f336]) ).
fof(f606,plain,
( spl51_3
| spl51_5 ),
inference(avatar_split_clause,[],[f542,f602,f594]) ).
fof(f542,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f535,f531,f531]) ).
fof(f531,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f336]) ).
fof(f535,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f336]) ).
fof(f605,plain,
( ~ spl51_1
| spl51_5 ),
inference(avatar_split_clause,[],[f541,f602,f586]) ).
fof(f541,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f536,f531,f532]) ).
fof(f532,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f336]) ).
fof(f536,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f336]) ).
fof(f600,plain,
( spl51_3
| spl51_4 ),
inference(avatar_split_clause,[],[f540,f598,f594]) ).
fof(f540,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK49
| app(cons(X4,nil),X5) != sK50
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK50 ),
inference(definition_unfolding,[],[f537,f532,f531,f531]) ).
fof(f537,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK47
| app(cons(X4,nil),X5) != sK48
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK48 ),
inference(cnf_transformation,[],[f336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC311+1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/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.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:21:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.57/0.73 % (32489)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.57/0.73 % (32490)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.57/0.73 % (32491)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.57/0.73 % (32486)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.73 % (32485)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.57/0.73 % (32484)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.57/0.74 % (32488)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.57/0.74 % (32487)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.57/0.75 % (32489)Instruction limit reached!
% 0.57/0.75 % (32489)------------------------------
% 0.57/0.75 % (32489)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (32489)Termination reason: Unknown
% 0.57/0.75 % (32489)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (32489)Memory used [KB]: 1619
% 0.57/0.75 % (32489)Time elapsed: 0.017 s
% 0.57/0.75 % (32489)Instructions burned: 47 (million)
% 0.57/0.75 % (32489)------------------------------
% 0.57/0.75 % (32489)------------------------------
% 0.57/0.75 % (32485)First to succeed.
% 0.57/0.75 % (32485)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32483"
% 0.57/0.75 % (32484)Instruction limit reached!
% 0.57/0.75 % (32484)------------------------------
% 0.57/0.75 % (32484)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (32484)Termination reason: Unknown
% 0.57/0.75 % (32484)Termination phase: Saturation
% 0.57/0.75
% 0.57/0.75 % (32484)Memory used [KB]: 1516
% 0.57/0.75 % (32484)Time elapsed: 0.021 s
% 0.57/0.75 % (32484)Instructions burned: 34 (million)
% 0.57/0.75 % (32484)------------------------------
% 0.57/0.75 % (32484)------------------------------
% 0.57/0.75 % (32485)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for theBenchmark
% 0.57/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75 % (32485)------------------------------
% 0.57/0.75 % (32485)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (32485)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (32485)Memory used [KB]: 1498
% 0.57/0.75 % (32485)Time elapsed: 0.019 s
% 0.57/0.75 % (32485)Instructions burned: 30 (million)
% 0.57/0.75 % (32483)Success in time 0.389 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------