TSTP Solution File: SWC104+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC104+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 : n019.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:38:49 EDT 2022
% Result : Theorem 1.49s 0.56s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 18 unt; 0 def)
% Number of atoms : 388 ( 127 equ)
% Maximal formula atoms : 42 ( 7 avg)
% Number of connectives : 527 ( 189 ~; 161 |; 153 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 138 ( 90 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f365,plain,
$false,
inference(subsumption_resolution,[],[f363,f357]) ).
fof(f357,plain,
~ neq(nil,nil),
inference(backward_demodulation,[],[f339,f343]) ).
fof(f343,plain,
nil = sK0,
inference(subsumption_resolution,[],[f342,f235]) ).
fof(f235,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f342,plain,
( nil = sK0
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f340,f208]) ).
fof(f208,plain,
ssList(sK0),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
( ssList(sK0)
& ( nil != sK2
| nil = sK3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = sK3
& neq(sK1,nil)
& sK2 = sK0
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,sK4) = sK3
& totalorderedP(sK2)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f108,f154,f153,f152,f151,f150]) ).
fof(f150,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X1 = X3
& neq(X1,nil)
& X0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(X1,sK0) )
& X1 = X3
& neq(X1,nil)
& sK0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(X1,sK0) )
& X1 = X3
& neq(X1,nil)
& sK0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = X3
& neq(sK1,nil)
& sK0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = X3
& neq(sK1,nil)
& sK0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = X3
& neq(sK1,nil)
& sK2 = sK0
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,X4) = X3
& totalorderedP(sK2)
& ssList(X4) )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = X3
& neq(sK1,nil)
& sK2 = sK0
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,X4) = X3
& totalorderedP(sK2)
& ssList(X4) )
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) )
& sK1 = sK3
& neq(sK1,nil)
& sK2 = sK0
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,X4) = sK3
& totalorderedP(sK2)
& ssList(X4) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,X4) = sK3
& totalorderedP(sK2)
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(sK2,sK4) = sK3
& totalorderedP(sK2)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X1 = X3
& neq(X1,nil)
& X0 = X2
& ? [X4] :
( ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& totalorderedP(X2)
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( totalorderedP(X2)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& ssList(X4) )
& X1 = X3
& ( nil != X2
| nil = X3 )
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& neq(X1,nil)
& X0 = X2
& 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)
=> ( ! [X4] :
( ssList(X4)
=> ( ~ totalorderedP(X2)
| app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& leq(X7,X5)
& app(X8,cons(X7,nil)) = X2 ) )
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) ) ) )
| X1 != X3
| ( nil != X3
& nil = X2 )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ( ~ totalorderedP(X2)
| app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& leq(X7,X5)
& app(X8,cons(X7,nil)) = X2 ) )
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) ) ) )
| X1 != X3
| ( nil != X3
& nil = X2 )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f340,plain,
( ~ ssList(sK0)
| nil = sK0
| ~ ssList(nil) ),
inference(resolution,[],[f339,f249]) ).
fof(f249,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f179]) ).
fof(f179,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != 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(f339,plain,
~ neq(sK0,nil),
inference(subsumption_resolution,[],[f259,f311]) ).
fof(f311,plain,
frontsegP(sK3,sK0),
inference(subsumption_resolution,[],[f310,f208]) ).
fof(f310,plain,
( frontsegP(sK3,sK0)
| ~ ssList(sK0) ),
inference(subsumption_resolution,[],[f309,f199]) ).
fof(f199,plain,
ssList(sK4),
inference(cnf_transformation,[],[f155]) ).
fof(f309,plain,
( frontsegP(sK3,sK0)
| ~ ssList(sK4)
| ~ ssList(sK0) ),
inference(subsumption_resolution,[],[f306,f198]) ).
fof(f198,plain,
ssList(sK3),
inference(cnf_transformation,[],[f155]) ).
fof(f306,plain,
( frontsegP(sK3,sK0)
| ~ ssList(sK3)
| ~ ssList(sK0)
| ~ ssList(sK4) ),
inference(superposition,[],[f272,f262]) ).
fof(f262,plain,
app(sK0,sK4) = sK3,
inference(definition_unfolding,[],[f201,f203]) ).
fof(f203,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f155]) ).
fof(f201,plain,
app(sK2,sK4) = sK3,
inference(cnf_transformation,[],[f155]) ).
fof(f272,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(X1,X3)) ),
inference(equality_resolution,[],[f236]) ).
fof(f236,plain,
! [X3,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X3) != X0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f175,plain,
! [X0] :
( ! [X1] :
( ( ( ( app(X1,sK13(X0,X1)) = X0
& ssList(sK13(X0,X1)) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f173,f174]) ).
fof(f174,plain,
! [X0,X1] :
( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
=> ( app(X1,sK13(X0,X1)) = X0
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f172]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ! [X1] :
( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f259,plain,
( ~ frontsegP(sK3,sK0)
| ~ neq(sK0,nil) ),
inference(definition_unfolding,[],[f206,f205]) ).
fof(f205,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f155]) ).
fof(f206,plain,
( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f363,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f260,f358]) ).
fof(f358,plain,
nil = sK3,
inference(trivial_inequality_removal,[],[f352]) ).
fof(f352,plain,
( nil != nil
| nil = sK3 ),
inference(backward_demodulation,[],[f258,f343]) ).
fof(f258,plain,
( nil = sK3
| nil != sK0 ),
inference(definition_unfolding,[],[f207,f203]) ).
fof(f207,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f155]) ).
fof(f260,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f204,f205]) ).
fof(f204,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC104+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:22:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (10568)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.51 % (10576)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.52 % (10568)Instruction limit reached!
% 0.20/0.52 % (10568)------------------------------
% 0.20/0.52 % (10568)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (10559)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.20/0.53 % (10568)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (10568)Termination reason: Unknown
% 0.20/0.53 % (10568)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (10568)Memory used [KB]: 2046
% 0.20/0.53 % (10568)Time elapsed: 0.104 s
% 0.20/0.53 % (10568)Instructions burned: 16 (million)
% 0.20/0.53 % (10568)------------------------------
% 0.20/0.53 % (10568)------------------------------
% 0.20/0.53 % (10557)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.20/0.53 % (10584)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53 % (10562)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.20/0.53 % (10584)Instruction limit reached!
% 0.20/0.53 % (10584)------------------------------
% 0.20/0.53 % (10584)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (10584)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (10584)Termination reason: Unknown
% 0.20/0.53 % (10584)Termination phase: Property scanning
% 0.20/0.53
% 0.20/0.53 % (10584)Memory used [KB]: 1791
% 0.20/0.53 % (10584)Time elapsed: 0.005 s
% 0.20/0.53 % (10584)Instructions burned: 9 (million)
% 0.20/0.53 % (10584)------------------------------
% 0.20/0.53 % (10584)------------------------------
% 0.20/0.53 % (10561)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.20/0.54 % (10561)First to succeed.
% 0.20/0.54 % (10558)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.20/0.54 % (10556)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.20/0.54 % (10582)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 % (10558)Instruction limit reached!
% 0.20/0.54 % (10558)------------------------------
% 0.20/0.54 % (10558)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (10558)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (10558)Termination reason: Unknown
% 0.20/0.54 % (10558)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (10558)Memory used [KB]: 1535
% 0.20/0.54 % (10558)Time elapsed: 0.003 s
% 0.20/0.54 % (10558)Instructions burned: 3 (million)
% 0.20/0.54 % (10558)------------------------------
% 0.20/0.54 % (10558)------------------------------
% 0.20/0.54 % (10583)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54 % (10563)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.20/0.54 % (10560)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.54 % (10573)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (10585)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.54 % (10573)Instruction limit reached!
% 0.20/0.54 % (10573)------------------------------
% 0.20/0.54 % (10573)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (10573)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (10573)Termination reason: Unknown
% 0.20/0.54 % (10573)Termination phase: Naming
% 0.20/0.54
% 0.20/0.54 % (10573)Memory used [KB]: 1535
% 0.20/0.54 % (10573)Time elapsed: 0.002 s
% 0.20/0.54 % (10573)Instructions burned: 3 (million)
% 0.20/0.54 % (10573)------------------------------
% 0.20/0.54 % (10573)------------------------------
% 1.49/0.55 % (10579)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.49/0.55 % (10581)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)
% 1.49/0.55 % (10570)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)
% 1.49/0.55 % (10564)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)
% 1.49/0.55 % (10570)Instruction limit reached!
% 1.49/0.55 % (10570)------------------------------
% 1.49/0.55 % (10570)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.55 % (10570)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.55 % (10570)Termination reason: Unknown
% 1.49/0.55 % (10570)Termination phase: Preprocessing 3
% 1.49/0.55
% 1.49/0.55 % (10570)Memory used [KB]: 1663
% 1.49/0.55 % (10570)Time elapsed: 0.003 s
% 1.49/0.55 % (10570)Instructions burned: 4 (million)
% 1.49/0.55 % (10570)------------------------------
% 1.49/0.55 % (10570)------------------------------
% 1.49/0.55 % (10578)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)
% 1.49/0.55 % (10577)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.49/0.55 % (10574)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.49/0.55 % (10574)Instruction limit reached!
% 1.49/0.55 % (10574)------------------------------
% 1.49/0.55 % (10574)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.55 % (10574)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.55 % (10574)Termination reason: Unknown
% 1.49/0.55 % (10574)Termination phase: Preprocessing 3
% 1.49/0.55
% 1.49/0.55 % (10574)Memory used [KB]: 1535
% 1.49/0.55 % (10574)Time elapsed: 0.003 s
% 1.49/0.55 % (10574)Instructions burned: 3 (million)
% 1.49/0.55 % (10574)------------------------------
% 1.49/0.55 % (10574)------------------------------
% 1.49/0.55 % (10575)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.49/0.55 % (10565)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)
% 1.49/0.55 % (10566)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.49/0.55 % (10557)Instruction limit reached!
% 1.49/0.55 % (10557)------------------------------
% 1.49/0.55 % (10557)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.55 % (10557)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.55 % (10557)Termination reason: Unknown
% 1.49/0.55 % (10557)Termination phase: Saturation
% 1.49/0.55
% 1.49/0.55 % (10557)Memory used [KB]: 6396
% 1.49/0.55 % (10557)Time elapsed: 0.140 s
% 1.49/0.55 % (10557)Instructions burned: 13 (million)
% 1.49/0.55 % (10557)------------------------------
% 1.49/0.55 % (10557)------------------------------
% 1.49/0.56 % (10572)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.49/0.56 % (10576)Instruction limit reached!
% 1.49/0.56 % (10576)------------------------------
% 1.49/0.56 % (10576)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.56 % (10576)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.56 % (10576)Termination reason: Unknown
% 1.49/0.56 % (10576)Termination phase: Saturation
% 1.49/0.56
% 1.49/0.56 % (10576)Memory used [KB]: 6524
% 1.49/0.56 % (10576)Time elapsed: 0.138 s
% 1.49/0.56 % (10576)Instructions burned: 30 (million)
% 1.49/0.56 % (10576)------------------------------
% 1.49/0.56 % (10576)------------------------------
% 1.49/0.56 % (10569)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.49/0.56 % (10571)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)
% 1.49/0.56 % (10580)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.49/0.56 % (10571)Instruction limit reached!
% 1.49/0.56 % (10571)------------------------------
% 1.49/0.56 % (10571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.56 % (10571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.56 % (10571)Termination reason: Unknown
% 1.49/0.56 % (10571)Termination phase: Saturation
% 1.49/0.56
% 1.49/0.56 % (10571)Memory used [KB]: 1791
% 1.49/0.56 % (10571)Time elapsed: 0.005 s
% 1.49/0.56 % (10571)Instructions burned: 9 (million)
% 1.49/0.56 % (10571)------------------------------
% 1.49/0.56 % (10571)------------------------------
% 1.49/0.56 % (10561)Refutation found. Thanks to Tanya!
% 1.49/0.56 % SZS status Theorem for theBenchmark
% 1.49/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.49/0.56 % (10561)------------------------------
% 1.49/0.56 % (10561)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.56 % (10561)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.56 % (10561)Termination reason: Refutation
% 1.49/0.56
% 1.49/0.56 % (10561)Memory used [KB]: 1663
% 1.49/0.56 % (10561)Time elapsed: 0.124 s
% 1.49/0.56 % (10561)Instructions burned: 7 (million)
% 1.49/0.56 % (10561)------------------------------
% 1.49/0.56 % (10561)------------------------------
% 1.49/0.56 % (10555)Success in time 0.202 s
%------------------------------------------------------------------------------