TSTP Solution File: SWC347+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC347+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n023.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 : Wed Aug 31 18:40:37 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 353 ( 105 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 481 ( 175 ~; 151 |; 131 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 136 ( 93 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f822,plain,
$false,
inference(avatar_sat_refutation,[],[f291,f292,f821]) ).
fof(f821,plain,
spl17_1,
inference(avatar_contradiction_clause,[],[f820]) ).
fof(f820,plain,
( $false
| spl17_1 ),
inference(subsumption_resolution,[],[f819,f251]) ).
fof(f251,plain,
ssList(sK14),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
( ssList(sK10)
& ssList(sK11)
& ssList(sK12)
& ( nil != sK12
| nil = sK13 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(sK13)
& sK12 = sK10
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != sK14 ) )
& app(sK12,sK14) = sK13
& strictorderedP(sK12)
& ssList(sK14)
& sK13 = sK11 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14])],[f115,f183,f182,f181,f180,f179]) ).
fof(f179,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(X1,X0)
| ~ strictorderedP(X0) )
& ssList(X3)
& X0 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& X1 = X3 ) ) ) )
=> ( ssList(sK10)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(X1,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK10 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& X1 = X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f180,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(X1,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK10 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& X1 = X3 ) ) )
=> ( ssList(sK11)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK10 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& sK11 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK10 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& sK11 = X3 ) )
=> ( ssList(sK12)
& ? [X3] :
( ( nil != sK12
| nil = X3 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK12 = sK10
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(sK12,X4) = X3
& strictorderedP(sK12)
& ssList(X4) )
& sK11 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
( ? [X3] :
( ( nil != sK12
| nil = X3 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(X3)
& sK12 = sK10
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(sK12,X4) = X3
& strictorderedP(sK12)
& ssList(X4) )
& sK11 = X3 )
=> ( ( nil != sK12
| nil = sK13 )
& ( ~ segmentP(sK11,sK10)
| ~ strictorderedP(sK10) )
& ssList(sK13)
& sK12 = sK10
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(sK12,X4) = sK13
& strictorderedP(sK12)
& ssList(X4) )
& sK13 = sK11 ) ),
introduced(choice_axiom,[]) ).
fof(f183,plain,
( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(sK12,X4) = sK13
& strictorderedP(sK12)
& ssList(X4) )
=> ( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK12
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != sK14 ) )
& app(sK12,sK14) = sK13
& strictorderedP(sK12)
& ssList(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ segmentP(X1,X0)
| ~ strictorderedP(X0) )
& ssList(X3)
& X0 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3
& strictorderedP(X2)
& ssList(X4) )
& X1 = X3 ) ) ) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ strictorderedP(X0) )
& X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) )
| app(cons(X5,nil),X6) != X4 ) )
& strictorderedP(X2)
& ssList(X4) )
& ( nil != X2
| nil = 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)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( app(X8,cons(X7,nil)) = X2
& ssList(X8)
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) )
| ~ strictorderedP(X2) ) )
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( app(X8,cons(X7,nil)) = X2
& ssList(X8)
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) )
| ~ strictorderedP(X2) ) )
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f819,plain,
( ~ ssList(sK14)
| spl17_1 ),
inference(subsumption_resolution,[],[f811,f286]) ).
fof(f286,plain,
( ~ segmentP(sK11,sK10)
| spl17_1 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl17_1
<=> segmentP(sK11,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_1])]) ).
fof(f811,plain,
( segmentP(sK11,sK10)
| ~ ssList(sK14) ),
inference(superposition,[],[f779,f269]) ).
fof(f269,plain,
app(sK10,sK14) = sK11,
inference(definition_unfolding,[],[f253,f255,f250]) ).
fof(f250,plain,
sK13 = sK11,
inference(cnf_transformation,[],[f184]) ).
fof(f255,plain,
sK12 = sK10,
inference(cnf_transformation,[],[f184]) ).
fof(f253,plain,
app(sK12,sK14) = sK13,
inference(cnf_transformation,[],[f184]) ).
fof(f779,plain,
! [X1] :
( segmentP(app(sK10,X1),sK10)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f778,f240]) ).
fof(f240,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f778,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(app(sK10,X1),sK10)
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f764,f261]) ).
fof(f261,plain,
ssList(sK10),
inference(cnf_transformation,[],[f184]) ).
fof(f764,plain,
! [X1] :
( ~ ssList(sK10)
| ~ ssList(X1)
| ~ ssList(nil)
| segmentP(app(sK10,X1),sK10) ),
inference(superposition,[],[f527,f303]) ).
fof(f303,plain,
app(nil,sK10) = sK10,
inference(resolution,[],[f209,f261]) ).
fof(f209,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f527,plain,
! [X6,X7,X5] :
( segmentP(app(app(X6,X7),X5),X7)
| ~ ssList(X5)
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(duplicate_literal_removal,[],[f524]) ).
fof(f524,plain,
! [X6,X7,X5] :
( segmentP(app(app(X6,X7),X5),X7)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X7)
| ~ ssList(X7)
| ~ ssList(X5) ),
inference(resolution,[],[f241,f203]) ).
fof(f203,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X3) ) )
| ~ ssList(X1) ) ),
inference(flattening,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax56) ).
fof(f292,plain,
spl17_2,
inference(avatar_split_clause,[],[f270,f288]) ).
fof(f288,plain,
( spl17_2
<=> strictorderedP(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f270,plain,
strictorderedP(sK10),
inference(definition_unfolding,[],[f252,f255]) ).
fof(f252,plain,
strictorderedP(sK12),
inference(cnf_transformation,[],[f184]) ).
fof(f291,plain,
( ~ spl17_1
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f257,f288,f284]) ).
fof(f257,plain,
( ~ strictorderedP(sK10)
| ~ segmentP(sK11,sK10) ),
inference(cnf_transformation,[],[f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC347+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 19:10:20 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 % (4615)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.49 % (4634)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.50 % (4626)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (4626)Instruction limit reached!
% 0.21/0.52 % (4626)------------------------------
% 0.21/0.52 % (4626)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (4626)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (4626)Termination reason: Unknown
% 0.21/0.52 % (4626)Termination phase: Naming
% 0.21/0.52
% 0.21/0.52 % (4626)Memory used [KB]: 1535
% 0.21/0.52 % (4626)Time elapsed: 0.004 s
% 0.21/0.52 % (4626)Instructions burned: 3 (million)
% 0.21/0.52 % (4626)------------------------------
% 0.21/0.52 % (4626)------------------------------
% 0.21/0.52 % (4609)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.53 % (4617)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.53 % (4624)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.53 % (4624)Instruction limit reached!
% 0.21/0.53 % (4624)------------------------------
% 0.21/0.53 % (4624)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (4624)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (4624)Termination reason: Unknown
% 0.21/0.53 % (4624)Termination phase: Property scanning
% 0.21/0.53
% 0.21/0.53 % (4624)Memory used [KB]: 1791
% 0.21/0.53 % (4624)Time elapsed: 0.004 s
% 0.21/0.53 % (4624)Instructions burned: 8 (million)
% 0.21/0.53 % (4624)------------------------------
% 0.21/0.53 % (4624)------------------------------
% 0.21/0.53 % (4611)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (4611)Instruction limit reached!
% 0.21/0.53 % (4611)------------------------------
% 0.21/0.53 % (4611)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (4611)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (4611)Termination reason: Unknown
% 0.21/0.53 % (4611)Termination phase: Preprocessing 3
% 0.21/0.53
% 0.21/0.53 % (4611)Memory used [KB]: 1663
% 0.21/0.53 % (4611)Time elapsed: 0.003 s
% 0.21/0.53 % (4611)Instructions burned: 4 (million)
% 0.21/0.53 % (4611)------------------------------
% 0.21/0.53 % (4611)------------------------------
% 0.21/0.53 % (4618)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.54 % (4623)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.54 % (4616)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.54 % (4623)Instruction limit reached!
% 0.21/0.54 % (4623)------------------------------
% 0.21/0.54 % (4623)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (4623)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (4623)Termination reason: Unknown
% 0.21/0.54 % (4623)Termination phase: Preprocessing 3
% 0.21/0.54
% 0.21/0.54 % (4623)Memory used [KB]: 1535
% 0.21/0.54 % (4623)Time elapsed: 0.003 s
% 0.21/0.54 % (4623)Instructions burned: 3 (million)
% 0.21/0.54 % (4623)------------------------------
% 0.21/0.54 % (4623)------------------------------
% 0.21/0.54 % (4631)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.54 % (4612)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.55 % (4614)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.55 % (4615)Instruction limit reached!
% 0.21/0.55 % (4615)------------------------------
% 0.21/0.55 % (4615)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (4615)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (4615)Termination reason: Unknown
% 0.21/0.55 % (4615)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (4615)Memory used [KB]: 6524
% 0.21/0.55 % (4615)Time elapsed: 0.112 s
% 0.21/0.55 % (4615)Instructions burned: 40 (million)
% 0.21/0.55 % (4615)------------------------------
% 0.21/0.55 % (4615)------------------------------
% 0.21/0.55 % (4610)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.55 % (4634)First to succeed.
% 0.21/0.55 % (4634)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (4634)------------------------------
% 0.21/0.55 % (4634)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (4634)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (4634)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (4634)Memory used [KB]: 6780
% 0.21/0.55 % (4634)Time elapsed: 0.125 s
% 0.21/0.55 % (4634)Instructions burned: 36 (million)
% 0.21/0.55 % (4634)------------------------------
% 0.21/0.55 % (4634)------------------------------
% 0.21/0.55 % (4608)Success in time 0.181 s
%------------------------------------------------------------------------------