TSTP Solution File: SWC419+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC419+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:50:59 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of formulae : 61 ( 9 unt; 0 def)
% Number of atoms : 393 ( 142 equ)
% Maximal formula atoms : 38 ( 6 avg)
% Number of connectives : 527 ( 195 ~; 169 |; 136 &)
% ( 5 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 120 ( 69 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f242,plain,
$false,
inference(avatar_sat_refutation,[],[f196,f201,f206,f211,f221,f240]) ).
fof(f240,plain,
( ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f239,plain,
( $false
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f238,f176]) ).
fof(f176,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.4y2RYMy238/Vampire---4.8_30513',ax17) ).
fof(f238,plain,
( ~ ssList(nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f235,f210]) ).
fof(f210,plain,
( ssItem(sK4)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f208]) ).
fof(f208,plain,
( spl10_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f235,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(resolution,[],[f160,f234]) ).
fof(f234,plain,
( ~ ssList(cons(sK4,nil))
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f233,f200]) ).
fof(f200,plain,
( sK3 = app(cons(sK4,nil),sK5)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f198,plain,
( spl10_3
<=> sK3 = app(cons(sK4,nil),sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f233,plain,
( sK3 != app(cons(sK4,nil),sK5)
| ~ ssList(cons(sK4,nil))
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(superposition,[],[f230,f169]) ).
fof(f169,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,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/tmp/tmp.4y2RYMy238/Vampire---4.8_30513',ax28) ).
fof(f230,plain,
( sK3 != app(app(nil,cons(sK4,nil)),sK5)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f229,f139]) ).
fof(f139,plain,
ssList(sK2),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( ( ~ neq(sK3,nil)
| ( sK2 = app(sK5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),sK5)
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(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,sK4,sK5])],[f99,f125,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = sK3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = sK3
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK2 = app(X5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),X5)
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X5] :
( sK2 = app(X5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),X5)
& ssList(X5) )
=> ( sK2 = app(sK5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(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] :
( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(app(X8,cons(X6,nil)),X7) = X0
& app(app(X7,cons(X6,nil)),X8) = X1
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) != X3
| ~ ssList(X8) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) != X3
| ~ ssList(X8) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4y2RYMy238/Vampire---4.8_30513',co1) ).
fof(f229,plain,
( sK3 != app(app(nil,cons(sK4,nil)),sK5)
| ~ ssList(sK2)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f227,f176]) ).
fof(f227,plain,
( sK3 != app(app(nil,cons(sK4,nil)),sK5)
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(trivial_inequality_removal,[],[f226]) ).
fof(f226,plain,
( sK2 != sK2
| sK3 != app(app(nil,cons(sK4,nil)),sK5)
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(superposition,[],[f224,f161]) ).
fof(f161,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.4y2RYMy238/Vampire---4.8_30513',ax84) ).
fof(f224,plain,
( ! [X0] :
( sK2 != app(sK2,X0)
| sK3 != app(app(X0,cons(sK4,nil)),sK5)
| ~ ssList(X0) )
| ~ spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f223,f210]) ).
fof(f223,plain,
( ! [X0] :
( sK2 != app(sK2,X0)
| sK3 != app(app(X0,cons(sK4,nil)),sK5)
| ~ ssList(X0)
| ~ ssItem(sK4) )
| ~ spl10_1
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f222,f205]) ).
fof(f205,plain,
( ssList(sK5)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f203,plain,
( spl10_4
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f222,plain,
( ! [X0] :
( sK2 != app(sK2,X0)
| sK3 != app(app(X0,cons(sK4,nil)),sK5)
| ~ ssList(sK5)
| ~ ssList(X0)
| ~ ssItem(sK4) )
| ~ spl10_1 ),
inference(superposition,[],[f177,f191]) ).
fof(f191,plain,
( sK2 = app(sK5,cons(sK4,nil))
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f189,plain,
( spl10_1
<=> sK2 = app(sK5,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f177,plain,
! [X8,X6,X7] :
( app(app(X8,cons(X6,nil)),X7) != sK2
| app(app(X7,cons(X6,nil)),X8) != sK3
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f144,f142,f141]) ).
fof(f141,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f126]) ).
fof(f142,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f126]) ).
fof(f144,plain,
! [X8,X6,X7] :
( app(app(X8,cons(X6,nil)),X7) != sK0
| app(app(X7,cons(X6,nil)),X8) != sK1
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f126]) ).
fof(f160,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,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/tmp/tmp.4y2RYMy238/Vampire---4.8_30513',ax16) ).
fof(f221,plain,
spl10_2,
inference(avatar_split_clause,[],[f178,f193]) ).
fof(f193,plain,
( spl10_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f178,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f143,f141]) ).
fof(f143,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f126]) ).
fof(f211,plain,
( spl10_5
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f146,f193,f208]) ).
fof(f146,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f126]) ).
fof(f206,plain,
( spl10_4
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f147,f193,f203]) ).
fof(f147,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f126]) ).
fof(f201,plain,
( spl10_3
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f148,f193,f198]) ).
fof(f148,plain,
( ~ neq(sK3,nil)
| sK3 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f126]) ).
fof(f196,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f149,f193,f189]) ).
fof(f149,plain,
( ~ neq(sK3,nil)
| sK2 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC419+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:23:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.4y2RYMy238/Vampire---4.8_30513
% 0.53/0.75 % (30766)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.53/0.75 % (30760)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.53/0.75 % (30762)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.53/0.75 % (30761)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.53/0.75 % (30764)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.53/0.75 % (30765)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.53/0.75 % (30767)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.53/0.75 % (30762)First to succeed.
% 0.53/0.75 % (30762)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30756"
% 0.58/0.76 % (30762)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (30762)------------------------------
% 0.58/0.76 % (30762)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (30762)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (30762)Memory used [KB]: 1161
% 0.58/0.76 % (30762)Time elapsed: 0.007 s
% 0.58/0.76 % (30762)Instructions burned: 10 (million)
% 0.58/0.76 % (30756)Success in time 0.387 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------