TSTP Solution File: SWC022+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC022+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:35:37 EDT 2024
% Result : Theorem 0.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 29
% Syntax : Number of formulae : 154 ( 10 unt; 0 def)
% Number of atoms : 736 ( 164 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 972 ( 390 ~; 393 |; 139 &)
% ( 15 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 179 ( 131 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f624,plain,
$false,
inference(avatar_sat_refutation,[],[f263,f267,f270,f279,f292,f320,f386,f418,f434,f570,f587,f623]) ).
fof(f623,plain,
( ~ spl10_2
| ~ spl10_3
| spl10_12 ),
inference(avatar_contradiction_clause,[],[f622]) ).
fof(f622,plain,
( $false
| ~ spl10_2
| ~ spl10_3
| spl10_12 ),
inference(subsumption_resolution,[],[f621,f165]) ).
fof(f165,plain,
ssList(sK2),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& 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])],[f100,f142,f141,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(X0,X6)
| ~ frontsegP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(X0,X6)
| ~ frontsegP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& ! [X6] :
( ~ frontsegP(X0,X6)
| ~ frontsegP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil) ) )
& 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ? [X6] :
( frontsegP(X0,X6)
& frontsegP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& X2 != X5
& ssList(X5) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ 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(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& X2 != X5
& ssList(X5) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f621,plain,
( ~ ssList(sK2)
| ~ spl10_2
| ~ spl10_3
| spl10_12 ),
inference(subsumption_resolution,[],[f620,f190]) ).
fof(f190,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f620,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl10_2
| ~ spl10_3
| spl10_12 ),
inference(subsumption_resolution,[],[f609,f326]) ).
fof(f326,plain,
( nil != sK2
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f325,f190]) ).
fof(f325,plain,
( nil != sK2
| ~ ssList(nil)
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f322,f253]) ).
fof(f253,plain,
( ssItem(hd(sK3))
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl10_3
<=> ssItem(hd(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f322,plain,
( nil != sK2
| ~ ssItem(hd(sK3))
| ~ ssList(nil)
| ~ spl10_2 ),
inference(superposition,[],[f184,f250]) ).
fof(f250,plain,
( sK2 = cons(hd(sK3),nil)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f248,plain,
( spl10_2
<=> sK2 = cons(hd(sK3),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f184,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,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/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f609,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl10_12 ),
inference(resolution,[],[f569,f187]) ).
fof(f187,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,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(f569,plain,
( ~ neq(sK2,nil)
| spl10_12 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f567,plain,
( spl10_12
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_12])]) ).
fof(f587,plain,
spl10_11,
inference(avatar_contradiction_clause,[],[f586]) ).
fof(f586,plain,
( $false
| spl10_11 ),
inference(subsumption_resolution,[],[f585,f165]) ).
fof(f585,plain,
( ~ ssList(sK2)
| spl10_11 ),
inference(resolution,[],[f565,f203]) ).
fof(f203,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f565,plain,
( ~ frontsegP(sK2,sK2)
| spl10_11 ),
inference(avatar_component_clause,[],[f563]) ).
fof(f563,plain,
( spl10_11
<=> frontsegP(sK2,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
fof(f570,plain,
( ~ spl10_11
| ~ spl10_12
| ~ spl10_2
| ~ spl10_3
| ~ spl10_6
| ~ spl10_8
| ~ spl10_9 ),
inference(avatar_split_clause,[],[f561,f400,f383,f265,f252,f248,f567,f563]) ).
fof(f265,plain,
( spl10_6
<=> ! [X6] :
( ~ frontsegP(sK2,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(sK3,X6) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f383,plain,
( spl10_8
<=> sK3 = cons(hd(sK2),sK6(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f400,plain,
( spl10_9
<=> ssList(sK6(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
fof(f561,plain,
( ~ neq(sK2,nil)
| ~ frontsegP(sK2,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_6
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f556,f165]) ).
fof(f556,plain,
( ~ ssList(sK2)
| ~ neq(sK2,nil)
| ~ frontsegP(sK2,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_6
| ~ spl10_8
| ~ spl10_9 ),
inference(resolution,[],[f544,f266]) ).
fof(f266,plain,
( ! [X6] :
( ~ frontsegP(sK3,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(sK2,X6) )
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f544,plain,
( frontsegP(sK3,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f543,f165]) ).
fof(f543,plain,
( ~ ssList(sK2)
| frontsegP(sK3,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f542,f401]) ).
fof(f401,plain,
( ssList(sK6(sK3))
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f400]) ).
fof(f542,plain,
( ~ ssList(sK6(sK3))
| ~ ssList(sK2)
| frontsegP(sK3,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f535,f166]) ).
fof(f166,plain,
ssList(sK3),
inference(cnf_transformation,[],[f143]) ).
fof(f535,plain,
( ~ ssList(sK3)
| ~ ssList(sK6(sK3))
| ~ ssList(sK2)
| frontsegP(sK3,sK2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_8
| ~ spl10_9 ),
inference(superposition,[],[f235,f491]) ).
fof(f491,plain,
( sK3 = app(sK2,sK6(sK3))
| ~ spl10_2
| ~ spl10_3
| ~ spl10_8
| ~ spl10_9 ),
inference(forward_demodulation,[],[f488,f385]) ).
fof(f385,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f383]) ).
fof(f488,plain,
( cons(hd(sK2),sK6(sK3)) = app(sK2,sK6(sK3))
| ~ spl10_2
| ~ spl10_3
| ~ spl10_9 ),
inference(resolution,[],[f393,f401]) ).
fof(f393,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK2),X0) = app(sK2,X0) )
| ~ spl10_2
| ~ spl10_3 ),
inference(forward_demodulation,[],[f388,f340]) ).
fof(f340,plain,
( sK2 = cons(hd(sK2),nil)
| ~ spl10_2
| ~ spl10_3 ),
inference(backward_demodulation,[],[f250,f339]) ).
fof(f339,plain,
( hd(sK3) = hd(sK2)
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f338,f190]) ).
fof(f338,plain,
( hd(sK3) = hd(sK2)
| ~ ssList(nil)
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f336,f253]) ).
fof(f336,plain,
( hd(sK3) = hd(sK2)
| ~ ssItem(hd(sK3))
| ~ ssList(nil)
| ~ spl10_2 ),
inference(superposition,[],[f194,f250]) ).
fof(f194,plain,
! [X0,X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax23) ).
fof(f388,plain,
( ! [X0] :
( cons(hd(sK2),X0) = app(cons(hd(sK2),nil),X0)
| ~ ssList(X0) )
| ~ spl10_2
| ~ spl10_3 ),
inference(resolution,[],[f214,f341]) ).
fof(f341,plain,
( ssItem(hd(sK2))
| ~ spl10_2
| ~ spl10_3 ),
inference(backward_demodulation,[],[f253,f339]) ).
fof(f214,plain,
! [X0,X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,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(f235,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f208]) ).
fof(f208,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f158,f159]) ).
fof(f159,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f434,plain,
( ~ spl10_4
| ~ spl10_7 ),
inference(avatar_contradiction_clause,[],[f433]) ).
fof(f433,plain,
( $false
| ~ spl10_4
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f431,f190]) ).
fof(f431,plain,
( ~ ssList(nil)
| ~ spl10_4
| ~ spl10_7 ),
inference(resolution,[],[f420,f241]) ).
fof(f241,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f231]) ).
fof(f231,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f186]) ).
fof(f186,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f420,plain,
( neq(nil,nil)
| ~ spl10_4
| ~ spl10_7 ),
inference(backward_demodulation,[],[f257,f381]) ).
fof(f381,plain,
( nil = sK3
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f379]) ).
fof(f379,plain,
( spl10_7
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f257,plain,
( neq(nil,sK3)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl10_4
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f418,plain,
( spl10_7
| spl10_9 ),
inference(avatar_split_clause,[],[f417,f400,f379]) ).
fof(f417,plain,
( nil = sK3
| spl10_9 ),
inference(subsumption_resolution,[],[f416,f166]) ).
fof(f416,plain,
( nil = sK3
| ~ ssList(sK3)
| spl10_9 ),
inference(resolution,[],[f402,f179]) ).
fof(f179,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( cons(sK7(X0),sK6(X0)) = X0
& ssItem(sK7(X0))
& ssList(sK6(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f103,f148,f147]) ).
fof(f147,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK6(X0)) = X0
& ssItem(X2) )
& ssList(sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK6(X0)) = X0
& ssItem(X2) )
=> ( cons(sK7(X0),sK6(X0)) = X0
& ssItem(sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f102]) ).
fof(f102,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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f402,plain,
( ~ ssList(sK6(sK3))
| spl10_9 ),
inference(avatar_component_clause,[],[f400]) ).
fof(f386,plain,
( spl10_7
| spl10_8
| ~ spl10_2
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f377,f252,f248,f383,f379]) ).
fof(f377,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| nil = sK3
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f371,f166]) ).
fof(f371,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ spl10_2
| ~ spl10_3 ),
inference(superposition,[],[f363,f339]) ).
fof(f363,plain,
! [X0] :
( cons(hd(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f360]) ).
fof(f360,plain,
! [X0] :
( cons(hd(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f181,f351]) ).
fof(f351,plain,
! [X0] :
( hd(X0) = sK7(X0)
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f350,f179]) ).
fof(f350,plain,
! [X0] :
( hd(X0) = sK7(X0)
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f346,f180]) ).
fof(f180,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f346,plain,
! [X0] :
( hd(X0) = sK7(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f194,f181]) ).
fof(f181,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f320,plain,
( spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f319]) ).
fof(f319,plain,
( $false
| spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f316,f315]) ).
fof(f315,plain,
( ~ neq(nil,nil)
| spl10_4 ),
inference(backward_demodulation,[],[f258,f311]) ).
fof(f311,plain,
( nil = sK3
| spl10_4 ),
inference(subsumption_resolution,[],[f310,f190]) ).
fof(f310,plain,
( nil = sK3
| ~ ssList(nil)
| spl10_4 ),
inference(subsumption_resolution,[],[f307,f166]) ).
fof(f307,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil)
| spl10_4 ),
inference(resolution,[],[f187,f258]) ).
fof(f258,plain,
( ~ neq(nil,sK3)
| spl10_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f316,plain,
( neq(nil,nil)
| spl10_4
| ~ spl10_5 ),
inference(backward_demodulation,[],[f261,f311]) ).
fof(f261,plain,
( neq(sK3,nil)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f260,plain,
( spl10_5
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f292,plain,
( spl10_3
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| spl10_3
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f289,f190]) ).
fof(f289,plain,
( ~ ssList(nil)
| spl10_3
| ~ spl10_5 ),
inference(resolution,[],[f285,f241]) ).
fof(f285,plain,
( neq(nil,nil)
| spl10_3
| ~ spl10_5 ),
inference(backward_demodulation,[],[f261,f281]) ).
fof(f281,plain,
( nil = sK3
| spl10_3 ),
inference(subsumption_resolution,[],[f280,f166]) ).
fof(f280,plain,
( nil = sK3
| ~ ssList(sK3)
| spl10_3 ),
inference(resolution,[],[f195,f254]) ).
fof(f254,plain,
( ~ ssItem(hd(sK3))
| spl10_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f195,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f115]) ).
fof(f115,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(f279,plain,
( ~ spl10_3
| spl10_1 ),
inference(avatar_split_clause,[],[f278,f244,f252]) ).
fof(f244,plain,
( spl10_1
<=> ssList(cons(hd(sK3),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f278,plain,
( ~ ssItem(hd(sK3))
| spl10_1 ),
inference(subsumption_resolution,[],[f277,f190]) ).
fof(f277,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(nil)
| spl10_1 ),
inference(resolution,[],[f185,f246]) ).
fof(f246,plain,
( ~ ssList(cons(hd(sK3),nil))
| spl10_1 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f185,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,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(f270,plain,
spl10_5,
inference(avatar_split_clause,[],[f242,f260]) ).
fof(f242,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f224]) ).
fof(f224,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f169,f167,f167]) ).
fof(f167,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f143]) ).
fof(f169,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f143]) ).
fof(f267,plain,
( spl10_6
| ~ spl10_5 ),
inference(avatar_split_clause,[],[f220,f260,f265]) ).
fof(f220,plain,
! [X6] :
( ~ neq(sK3,nil)
| ~ frontsegP(sK2,X6)
| ~ frontsegP(sK3,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f173,f168,f167]) ).
fof(f168,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f143]) ).
fof(f173,plain,
! [X6] :
( ~ neq(sK3,nil)
| ~ frontsegP(sK0,X6)
| ~ frontsegP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f143]) ).
fof(f263,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_split_clause,[],[f228,f260,f256,f252,f248,f244]) ).
fof(f228,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| sK2 = cons(hd(sK3),nil)
| ~ ssList(cons(hd(sK3),nil)) ),
inference(equality_resolution,[],[f227]) ).
fof(f227,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| cons(hd(sK3),nil) != X4
| ~ ssItem(hd(sK3))
| sK2 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f174]) ).
fof(f174,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK2 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC022+1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.13 % 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.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:14:07 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.19/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.19/0.35 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.55/0.76 % (23932)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 (2995ds/56Mi)
% 0.55/0.76 % (23931)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.55/0.76 % (23929)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.55/0.76 % (23925)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.55/0.76 % (23927)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.55/0.76 % (23926)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.55/0.76 % (23928)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.55/0.76 % (23930)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.59/0.77 % (23929)Instruction limit reached!
% 0.59/0.77 % (23929)------------------------------
% 0.59/0.77 % (23929)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (23929)Termination reason: Unknown
% 0.59/0.77 % (23929)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (23929)Memory used [KB]: 2027
% 0.59/0.77 % (23929)Time elapsed: 0.012 s
% 0.59/0.77 % (23929)Instructions burned: 35 (million)
% 0.59/0.77 % (23929)------------------------------
% 0.59/0.77 % (23929)------------------------------
% 0.59/0.78 % (23927)First to succeed.
% 0.59/0.78 % (23933)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 (2995ds/55Mi)
% 0.59/0.78 % (23927)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23923"
% 0.59/0.78 % (23928)Instruction limit reached!
% 0.59/0.78 % (23928)------------------------------
% 0.59/0.78 % (23928)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (23928)Termination reason: Unknown
% 0.59/0.78 % (23928)Termination phase: Saturation
% 0.59/0.78
% 0.59/0.78 % (23928)Memory used [KB]: 1692
% 0.59/0.78 % (23928)Time elapsed: 0.019 s
% 0.59/0.78 % (23927)Refutation found. Thanks to Tanya!
% 0.59/0.78 % SZS status Theorem for theBenchmark
% 0.59/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.78 % (23927)------------------------------
% 0.59/0.78 % (23927)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (23927)Termination reason: Refutation
% 0.59/0.78
% 0.59/0.78 % (23927)Memory used [KB]: 1321
% 0.59/0.78 % (23927)Time elapsed: 0.018 s
% 0.59/0.78 % (23927)Instructions burned: 27 (million)
% 0.59/0.78 % (23923)Success in time 0.419 s
% 0.59/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------