TSTP Solution File: SWC120+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC120+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 : n028.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:36:22 EDT 2024
% Result : Theorem 0.71s 0.78s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 31
% Syntax : Number of formulae : 154 ( 11 unt; 0 def)
% Number of atoms : 703 ( 191 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 891 ( 342 ~; 360 |; 141 &)
% ( 16 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 182 ( 132 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1186,plain,
$false,
inference(avatar_sat_refutation,[],[f256,f273,f276,f284,f303,f412,f642,f727,f777,f1117,f1144,f1171]) ).
fof(f1171,plain,
( spl13_1
| ~ spl13_3
| ~ spl13_8
| ~ spl13_12 ),
inference(avatar_contradiction_clause,[],[f1170]) ).
fof(f1170,plain,
( $false
| spl13_1
| ~ spl13_3
| ~ spl13_8
| ~ spl13_12 ),
inference(subsumption_resolution,[],[f1155,f1146]) ).
fof(f1146,plain,
( ~ neq(nil,nil)
| spl13_1
| ~ spl13_12 ),
inference(forward_demodulation,[],[f247,f618]) ).
fof(f618,plain,
( nil = sK2
| ~ spl13_12 ),
inference(avatar_component_clause,[],[f616]) ).
fof(f616,plain,
( spl13_12
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_12])]) ).
fof(f247,plain,
( ~ neq(sK2,nil)
| spl13_1 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl13_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
fof(f1155,plain,
( neq(nil,nil)
| ~ spl13_3
| ~ spl13_8 ),
inference(superposition,[],[f254,f308]) ).
fof(f308,plain,
( nil = sK3
| ~ spl13_8 ),
inference(avatar_component_clause,[],[f306]) ).
fof(f306,plain,
( spl13_8
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_8])]) ).
fof(f254,plain,
( neq(sK3,nil)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f253,plain,
( spl13_3
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
fof(f1144,plain,
( spl13_12
| ~ spl13_9
| ~ spl13_6 ),
inference(avatar_split_clause,[],[f1143,f266,f354,f616]) ).
fof(f354,plain,
( spl13_9
<=> nil = sF12 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_9])]) ).
fof(f266,plain,
( spl13_6
<=> ssList(sF11) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_6])]) ).
fof(f1143,plain,
( nil != sF12
| nil = sK2
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f1142,f165]) ).
fof(f165,plain,
ssList(sK2),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5) )
| sK3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f143,f142,f141,f140]) ).
fof(f140,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(sK2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(sK2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5) )
| sK3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& ssList(X5) )
& X3 != X4
& 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) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& ssList(X5) )
& X3 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1142,plain,
( nil != sF12
| nil = sK2
| ~ ssList(sK2)
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f366,f267]) ).
fof(f267,plain,
( ssList(sF11)
| ~ spl13_6 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f366,plain,
( nil != sF12
| nil = sK2
| ~ ssList(sF11)
| ~ ssList(sK2) ),
inference(superposition,[],[f177,f237]) ).
fof(f237,plain,
app(sK2,sF11) = sF12,
introduced(function_definition,[new_symbols(definition,[sF12])]) ).
fof(f177,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f145]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f1117,plain,
( spl13_2
| ~ spl13_5
| ~ spl13_6 ),
inference(avatar_split_clause,[],[f1112,f266,f262,f249]) ).
fof(f249,plain,
( spl13_2
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
fof(f262,plain,
( spl13_5
<=> sK3 = sF12 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_5])]) ).
fof(f1112,plain,
( segmentP(sK3,sK2)
| ~ spl13_5
| ~ spl13_6 ),
inference(forward_demodulation,[],[f1111,f264]) ).
fof(f264,plain,
( sK3 = sF12
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f1111,plain,
( segmentP(sF12,sK2)
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f1110,f165]) ).
fof(f1110,plain,
( segmentP(sF12,sK2)
| ~ ssList(sK2)
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f1089,f267]) ).
fof(f1089,plain,
( segmentP(sF12,sK2)
| ~ ssList(sF11)
| ~ ssList(sK2) ),
inference(superposition,[],[f890,f237]) ).
fof(f890,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f889,f195]) ).
fof(f195,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,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(f889,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(subsumption_resolution,[],[f879,f200]) ).
fof(f200,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f879,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(duplicate_literal_removal,[],[f869]) ).
fof(f869,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0) ),
inference(superposition,[],[f235,f183]) ).
fof(f183,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,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/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f235,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,[],[f218]) ).
fof(f218,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,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f159,f161,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f159,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,[],[f158]) ).
fof(f158,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,[],[f139]) ).
fof(f139,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(f777,plain,
( ~ spl13_3
| spl13_7
| ~ spl13_8 ),
inference(avatar_contradiction_clause,[],[f776]) ).
fof(f776,plain,
( $false
| ~ spl13_3
| spl13_7
| ~ spl13_8 ),
inference(subsumption_resolution,[],[f772,f751]) ).
fof(f751,plain,
( ~ neq(nil,nil)
| spl13_7
| ~ spl13_8 ),
inference(forward_demodulation,[],[f272,f308]) ).
fof(f272,plain,
( ~ neq(nil,sK3)
| spl13_7 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl13_7
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_7])]) ).
fof(f772,plain,
( neq(nil,nil)
| ~ spl13_3
| ~ spl13_8 ),
inference(superposition,[],[f254,f308]) ).
fof(f727,plain,
( ~ spl13_8
| ~ spl13_5
| spl13_9 ),
inference(avatar_split_clause,[],[f644,f354,f262,f306]) ).
fof(f644,plain,
( nil != sK3
| ~ spl13_5
| spl13_9 ),
inference(superposition,[],[f356,f264]) ).
fof(f356,plain,
( nil != sF12
| spl13_9 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f642,plain,
( spl13_7
| spl13_8 ),
inference(avatar_contradiction_clause,[],[f641]) ).
fof(f641,plain,
( $false
| spl13_7
| spl13_8 ),
inference(subsumption_resolution,[],[f640,f200]) ).
fof(f640,plain,
( ~ ssList(nil)
| spl13_7
| spl13_8 ),
inference(subsumption_resolution,[],[f639,f166]) ).
fof(f166,plain,
ssList(sK3),
inference(cnf_transformation,[],[f144]) ).
fof(f639,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| spl13_7
| spl13_8 ),
inference(subsumption_resolution,[],[f628,f307]) ).
fof(f307,plain,
( nil != sK3
| spl13_8 ),
inference(avatar_component_clause,[],[f306]) ).
fof(f628,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil)
| spl13_7 ),
inference(resolution,[],[f272,f197]) ).
fof(f197,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,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(f412,plain,
( spl13_1
| ~ spl13_5
| ~ spl13_6
| spl13_8 ),
inference(avatar_contradiction_clause,[],[f411]) ).
fof(f411,plain,
( $false
| spl13_1
| ~ spl13_5
| ~ spl13_6
| spl13_8 ),
inference(subsumption_resolution,[],[f410,f166]) ).
fof(f410,plain,
( ~ ssList(sK3)
| spl13_1
| ~ spl13_5
| ~ spl13_6
| spl13_8 ),
inference(subsumption_resolution,[],[f409,f307]) ).
fof(f409,plain,
( nil = sK3
| ~ ssList(sK3)
| spl13_1
| ~ spl13_5
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f407,f334]) ).
fof(f334,plain,
( sK3 = sF11
| spl13_1
| ~ spl13_5
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f331,f267]) ).
fof(f331,plain,
( sK3 = sF11
| ~ ssList(sF11)
| spl13_1
| ~ spl13_5 ),
inference(superposition,[],[f321,f183]) ).
fof(f321,plain,
( sK3 = app(nil,sF11)
| spl13_1
| ~ spl13_5 ),
inference(forward_demodulation,[],[f318,f264]) ).
fof(f318,plain,
( sF12 = app(nil,sF11)
| spl13_1 ),
inference(superposition,[],[f237,f317]) ).
fof(f317,plain,
( nil = sK2
| spl13_1 ),
inference(subsumption_resolution,[],[f316,f165]) ).
fof(f316,plain,
( nil = sK2
| ~ ssList(sK2)
| spl13_1 ),
inference(subsumption_resolution,[],[f311,f200]) ).
fof(f311,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl13_1 ),
inference(resolution,[],[f197,f247]) ).
fof(f407,plain,
( sK3 != sF11
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f406,f236]) ).
fof(f236,plain,
tl(sK3) = sF11,
introduced(function_definition,[new_symbols(definition,[sF11])]) ).
fof(f406,plain,
! [X0] :
( tl(X0) != X0
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f401]) ).
fof(f401,plain,
! [X0] :
( tl(X0) != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f378,f376]) ).
fof(f376,plain,
! [X0] :
( tl(X0) = sK4(X0)
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f375,f186]) ).
fof(f186,plain,
! [X0] :
( ssList(sK4(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( cons(sK5(X0),sK4(X0)) = X0
& ssItem(sK5(X0))
& ssList(sK4(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f112,f148,f147]) ).
fof(f147,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK4(X0)) = X0
& ssItem(X2) )
& ssList(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK4(X0)) = X0
& ssItem(X2) )
=> ( cons(sK5(X0),sK4(X0)) = X0
& ssItem(sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f111,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(f375,plain,
! [X0] :
( tl(X0) = sK4(X0)
| ~ ssList(sK4(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f372,f187]) ).
fof(f187,plain,
! [X0] :
( ssItem(sK5(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f372,plain,
! [X0] :
( tl(X0) = sK4(X0)
| ~ ssItem(sK5(X0))
| ~ ssList(sK4(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f206,f188]) ).
fof(f188,plain,
! [X0] :
( cons(sK5(X0),sK4(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f206,plain,
! [X0,X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax25) ).
fof(f378,plain,
! [X0] :
( sK4(X0) != X0
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f377,f186]) ).
fof(f377,plain,
! [X0] :
( sK4(X0) != X0
| ~ ssList(sK4(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f373,f187]) ).
fof(f373,plain,
! [X0] :
( sK4(X0) != X0
| ~ ssItem(sK5(X0))
| ~ ssList(sK4(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f191,f188]) ).
fof(f191,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,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(f303,plain,
( ~ spl13_3
| spl13_6 ),
inference(avatar_contradiction_clause,[],[f302]) ).
fof(f302,plain,
( $false
| ~ spl13_3
| spl13_6 ),
inference(subsumption_resolution,[],[f300,f200]) ).
fof(f300,plain,
( ~ ssList(nil)
| ~ spl13_3
| spl13_6 ),
inference(resolution,[],[f290,f241]) ).
fof(f241,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f232]) ).
fof(f232,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f196]) ).
fof(f196,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f290,plain,
( neq(nil,nil)
| ~ spl13_3
| spl13_6 ),
inference(superposition,[],[f254,f287]) ).
fof(f287,plain,
( nil = sK3
| spl13_6 ),
inference(subsumption_resolution,[],[f286,f166]) ).
fof(f286,plain,
( nil = sK3
| ~ ssList(sK3)
| spl13_6 ),
inference(subsumption_resolution,[],[f285,f268]) ).
fof(f268,plain,
( ~ ssList(sF11)
| spl13_6 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f285,plain,
( ssList(sF11)
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f207,f236]) ).
fof(f207,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f128,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(f284,plain,
( ~ spl13_6
| spl13_4 ),
inference(avatar_split_clause,[],[f283,f258,f266]) ).
fof(f258,plain,
( spl13_4
<=> ssList(sF12) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
fof(f283,plain,
( ssList(sF12)
| ~ ssList(sF11) ),
inference(subsumption_resolution,[],[f278,f165]) ).
fof(f278,plain,
( ssList(sF12)
| ~ ssList(sF11)
| ~ ssList(sK2) ),
inference(superposition,[],[f195,f237]) ).
fof(f276,plain,
spl13_3,
inference(avatar_split_clause,[],[f243,f253]) ).
fof(f243,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f223,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f169,f167,f167]) ).
fof(f167,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f144]) ).
fof(f169,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f273,plain,
( ~ spl13_4
| spl13_5
| ~ spl13_6
| ~ spl13_7
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f238,f253,f270,f266,f262,f258]) ).
fof(f238,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssList(sF11)
| sK3 = sF12
| ~ ssList(sF12) ),
inference(definition_folding,[],[f227,f237,f236,f237,f236,f236]) ).
fof(f227,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssList(tl(sK3))
| sK3 = app(sK2,tl(sK3))
| ~ ssList(app(sK2,tl(sK3))) ),
inference(equality_resolution,[],[f226]) ).
fof(f226,plain,
! [X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| tl(sK3) != X5
| ~ ssList(X5)
| app(sK2,X5) = sK3
| ~ ssList(app(sK2,X5)) ),
inference(equality_resolution,[],[f173]) ).
fof(f173,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f256,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f219,f253,f249,f245]) ).
fof(f219,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f174,f167,f168,f168]) ).
fof(f168,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f174,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC120+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/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.13/0.34 % Computer : n028.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:49:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.73 % (15551)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.55/0.73 % (15544)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.55/0.73 % (15546)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (15547)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.55/0.73 % (15545)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.55/0.73 % (15549)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.55/0.73 % (15548)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.55/0.73 % (15550)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.55/0.73 % (15551)Refutation not found, incomplete strategy% (15551)------------------------------
% 0.55/0.73 % (15551)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (15551)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (15551)Memory used [KB]: 1163
% 0.55/0.73 % (15551)Time elapsed: 0.003 s
% 0.55/0.73 % (15551)Instructions burned: 6 (million)
% 0.55/0.73 % (15551)------------------------------
% 0.55/0.73 % (15551)------------------------------
% 0.55/0.73 % (15552)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.55/0.75 % (15547)Instruction limit reached!
% 0.55/0.75 % (15547)------------------------------
% 0.55/0.75 % (15547)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (15548)Instruction limit reached!
% 0.55/0.75 % (15548)------------------------------
% 0.55/0.75 % (15548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (15548)Termination reason: Unknown
% 0.55/0.75 % (15548)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (15548)Memory used [KB]: 2028
% 0.55/0.75 % (15548)Time elapsed: 0.020 s
% 0.55/0.75 % (15548)Instructions burned: 34 (million)
% 0.55/0.75 % (15548)------------------------------
% 0.55/0.75 % (15548)------------------------------
% 0.55/0.75 % (15547)Termination reason: Unknown
% 0.55/0.75 % (15547)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (15547)Memory used [KB]: 1806
% 0.55/0.75 % (15547)Time elapsed: 0.020 s
% 0.55/0.75 % (15547)Instructions burned: 35 (million)
% 0.55/0.75 % (15547)------------------------------
% 0.55/0.75 % (15547)------------------------------
% 0.55/0.75 % (15544)Instruction limit reached!
% 0.55/0.75 % (15544)------------------------------
% 0.55/0.75 % (15544)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (15544)Termination reason: Unknown
% 0.55/0.75 % (15544)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (15544)Memory used [KB]: 1454
% 0.55/0.75 % (15544)Time elapsed: 0.021 s
% 0.55/0.75 % (15544)Instructions burned: 35 (million)
% 0.55/0.75 % (15544)------------------------------
% 0.55/0.75 % (15544)------------------------------
% 0.55/0.75 % (15552)Instruction limit reached!
% 0.55/0.75 % (15552)------------------------------
% 0.55/0.75 % (15552)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (15552)Termination reason: Unknown
% 0.55/0.75 % (15552)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (15552)Memory used [KB]: 2032
% 0.55/0.75 % (15552)Time elapsed: 0.019 s
% 0.55/0.75 % (15552)Instructions burned: 58 (million)
% 0.55/0.75 % (15552)------------------------------
% 0.55/0.75 % (15552)------------------------------
% 0.55/0.75 % (15553)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.55/0.75 % (15554)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.55/0.75 % (15555)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.55/0.75 % (15556)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.55/0.75 % (15549)Instruction limit reached!
% 0.55/0.75 % (15549)------------------------------
% 0.55/0.75 % (15549)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (15549)Termination reason: Unknown
% 0.55/0.75 % (15549)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (15549)Memory used [KB]: 1691
% 0.55/0.75 % (15549)Time elapsed: 0.028 s
% 0.55/0.75 % (15549)Instructions burned: 45 (million)
% 0.55/0.75 % (15549)------------------------------
% 0.55/0.75 % (15549)------------------------------
% 0.55/0.76 % (15557)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2996ds/42Mi)
% 0.55/0.76 % (15545)Instruction limit reached!
% 0.55/0.76 % (15545)------------------------------
% 0.55/0.76 % (15545)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (15545)Termination reason: Unknown
% 0.55/0.76 % (15545)Termination phase: Saturation
% 0.55/0.76
% 0.55/0.76 % (15545)Memory used [KB]: 1936
% 0.55/0.76 % (15545)Time elapsed: 0.033 s
% 0.55/0.76 % (15545)Instructions burned: 52 (million)
% 0.55/0.76 % (15545)------------------------------
% 0.55/0.76 % (15545)------------------------------
% 0.71/0.76 % (15558)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.71/0.77 % (15550)Instruction limit reached!
% 0.71/0.77 % (15550)------------------------------
% 0.71/0.77 % (15550)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.77 % (15550)Termination reason: Unknown
% 0.71/0.77 % (15550)Termination phase: Saturation
% 0.71/0.77
% 0.71/0.77 % (15550)Memory used [KB]: 2042
% 0.71/0.77 % (15550)Time elapsed: 0.041 s
% 0.71/0.77 % (15550)Instructions burned: 85 (million)
% 0.71/0.77 % (15550)------------------------------
% 0.71/0.77 % (15550)------------------------------
% 0.71/0.77 % (15559)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2995ds/117Mi)
% 0.71/0.77 % (15546)Instruction limit reached!
% 0.71/0.77 % (15546)------------------------------
% 0.71/0.77 % (15546)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.77 % (15546)Termination reason: Unknown
% 0.71/0.77 % (15546)Termination phase: Saturation
% 0.71/0.77
% 0.71/0.77 % (15546)Memory used [KB]: 1899
% 0.71/0.77 % (15546)Time elapsed: 0.047 s
% 0.71/0.77 % (15546)Instructions burned: 78 (million)
% 0.71/0.77 % (15546)------------------------------
% 0.71/0.77 % (15546)------------------------------
% 0.71/0.77 % (15553)Instruction limit reached!
% 0.71/0.77 % (15553)------------------------------
% 0.71/0.77 % (15553)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.77 % (15553)Termination reason: Unknown
% 0.71/0.77 % (15553)Termination phase: Saturation
% 0.71/0.77
% 0.71/0.77 % (15553)Memory used [KB]: 1848
% 0.71/0.77 % (15553)Time elapsed: 0.026 s
% 0.71/0.77 % (15553)Instructions burned: 50 (million)
% 0.71/0.77 % (15553)------------------------------
% 0.71/0.77 % (15553)------------------------------
% 0.71/0.78 % (15554)First to succeed.
% 0.71/0.78 % (15560)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2995ds/143Mi)
% 0.71/0.78 % (15561)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2995ds/93Mi)
% 0.71/0.78 % (15554)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15543"
% 0.71/0.78 % (15554)Refutation found. Thanks to Tanya!
% 0.71/0.78 % SZS status Theorem for theBenchmark
% 0.71/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.78 % (15554)------------------------------
% 0.71/0.78 % (15554)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.78 % (15554)Termination reason: Refutation
% 0.71/0.78
% 0.71/0.78 % (15554)Memory used [KB]: 1490
% 0.71/0.78 % (15554)Time elapsed: 0.031 s
% 0.71/0.78 % (15554)Instructions burned: 51 (million)
% 0.71/0.78 % (15543)Success in time 0.421 s
% 0.71/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------