TSTP Solution File: SWC179+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC179+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_sat --cores 0 -t %d %s
% Computer : n010.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:42:14 EDT 2022
% Result : Theorem 1.32s 0.53s
% Output : Refutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 357 ( 114 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 426 ( 122 ~; 110 |; 165 &)
% ( 0 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 129 ( 71 !; 58 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_28,type,
sQ62_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_29,type,
sQ63_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_30,type,
sQ64_eqProxy: ( $real * $real ) > $o ).
fof(f1651,plain,
$false,
inference(subsumption_resolution,[],[f1623,f728]) ).
fof(f728,plain,
duplicatefreeP(nil),
inference(literal_reordering,[],[f530]) ).
fof(f530,plain,
duplicatefreeP(nil),
inference(cnf_transformation,[],[f72]) ).
fof(f72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax72) ).
fof(f1623,plain,
~ duplicatefreeP(nil),
inference(backward_demodulation,[],[f800,f1600]) ).
fof(f1600,plain,
nil = sK28,
inference(subsumption_resolution,[],[f1599,f1324]) ).
fof(f1324,plain,
( ssItem(sK25(nil,sK28))
| nil = sK28 ),
inference(backward_demodulation,[],[f1033,f1308]) ).
fof(f1308,plain,
nil = sK29,
inference(subsumption_resolution,[],[f1307,f1032]) ).
fof(f1032,plain,
( ssItem(sK25(sK29,sK28))
| nil = sK29 ),
inference(resolution,[],[f723,f687]) ).
fof(f687,plain,
( sP2(sK29,sK28)
| nil = sK29 ),
inference(literal_reordering,[],[f574]) ).
fof(f574,plain,
( nil = sK29
| sP2(sK29,sK28) ),
inference(definition_unfolding,[],[f452,f450,f450,f453]) ).
fof(f453,plain,
sK30 = sK28,
inference(cnf_transformation,[],[f289]) ).
fof(f289,plain,
( ssList(sK30)
& ssList(sK31)
& ~ duplicatefreeP(sK28)
& sK30 = sK28
& ( ( nil = sK31
& nil = sK30 )
| sP2(sK31,sK30) )
& sK31 = sK29
& ssList(sK29)
& ssList(sK28) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31])],[f228,f288,f287,f286,f285]) ).
fof(f285,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(X0)
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& X1 = X3 ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK28 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& X1 = X3 ) )
& ssList(X1) )
& ssList(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK28 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& X1 = X3 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK28 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& sK29 = X3 ) )
& ssList(sK29) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK28 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& sK29 = X3 ) )
=> ( ssList(sK30)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK30 = sK28
& ( ( nil = X3
& nil = sK30 )
| sP2(X3,sK30) )
& sK29 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
( ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(sK28)
& sK30 = sK28
& ( ( nil = X3
& nil = sK30 )
| sP2(X3,sK30) )
& sK29 = X3 )
=> ( ssList(sK31)
& ~ duplicatefreeP(sK28)
& sK30 = sK28
& ( ( nil = sK31
& nil = sK30 )
| sP2(sK31,sK30) )
& sK31 = sK29 ) ),
introduced(choice_axiom,[]) ).
fof(f228,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(X0)
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| sP2(X3,X2) )
& X1 = X3 ) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f106,f227]) ).
fof(f227,plain,
! [X3,X2] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( app(app(X5,X2),X6) = X3
& ssList(X6)
& ! [X8] :
( ~ lt(X4,X8)
| ~ ssItem(X8)
| ~ memberP(X5,X8) )
& ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& cons(X4,nil) = X2 )
& ssList(X5) ) )
| ~ sP2(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f106,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ duplicatefreeP(X0)
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( app(app(X5,X2),X6) = X3
& ssList(X6)
& ! [X8] :
( ~ lt(X4,X8)
| ~ ssItem(X8)
| ~ memberP(X5,X8) )
& ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& cons(X4,nil) = X2 )
& ssList(X5) ) ) )
& X1 = X3 ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ duplicatefreeP(X0)
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ ssItem(X8)
| ~ memberP(X5,X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| duplicatefreeP(X0)
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( memberP(X6,X7)
& lt(X7,X4)
& ssItem(X7) )
| ? [X8] :
( memberP(X5,X8)
& ssItem(X8)
& lt(X4,X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( duplicatefreeP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| ? [X8] :
( ssItem(X8)
& lt(X8,X4)
& memberP(X6,X8) )
| app(app(X5,X2),X6) != X3
| ? [X7] :
( memberP(X5,X7)
& lt(X4,X7)
& ssItem(X7) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( duplicatefreeP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| ? [X8] :
( ssItem(X8)
& lt(X8,X4)
& memberP(X6,X8) )
| app(app(X5,X2),X6) != X3
| ? [X7] :
( memberP(X5,X7)
& lt(X4,X7)
& ssItem(X7) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f450,plain,
sK31 = sK29,
inference(cnf_transformation,[],[f289]) ).
fof(f452,plain,
( nil = sK31
| sP2(sK31,sK30) ),
inference(cnf_transformation,[],[f289]) ).
fof(f723,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| ssItem(sK25(X0,X1)) ),
inference(literal_reordering,[],[f447]) ).
fof(f447,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| ssItem(sK25(X0,X1)) ),
inference(cnf_transformation,[],[f284]) ).
fof(f284,plain,
! [X0,X1] :
( ( ssItem(sK25(X0,X1))
& app(app(sK26(X0,X1),X1),sK27(X0,X1)) = X0
& ssList(sK27(X0,X1))
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(sK26(X0,X1),X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(sK27(X0,X1),X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1
& ssList(sK26(X0,X1)) )
| ~ sP2(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK25,sK26,sK27])],[f280,f283,f282,f281]) ).
fof(f281,plain,
! [X0,X1] :
( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ? [X4] :
( app(app(X3,X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(X2,X5)
| ~ ssItem(X5)
| ~ memberP(X3,X5) )
& ! [X6] :
( ~ lt(X6,X2)
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(X2,nil) = X1 )
& ssList(X3) ) )
=> ( ssItem(sK25(X0,X1))
& ? [X3] :
( ? [X4] :
( app(app(X3,X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(X3,X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1 )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( app(app(X3,X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(X3,X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1 )
& ssList(X3) )
=> ( ? [X4] :
( app(app(sK26(X0,X1),X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(sK26(X0,X1),X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1 )
& ssList(sK26(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
! [X0,X1] :
( ? [X4] :
( app(app(sK26(X0,X1),X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(sK26(X0,X1),X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1 )
=> ( app(app(sK26(X0,X1),X1),sK27(X0,X1)) = X0
& ssList(sK27(X0,X1))
& ! [X5] :
( ~ lt(sK25(X0,X1),X5)
| ~ ssItem(X5)
| ~ memberP(sK26(X0,X1),X5) )
& ! [X6] :
( ~ lt(X6,sK25(X0,X1))
| ~ memberP(sK27(X0,X1),X6)
| ~ ssItem(X6) )
& cons(sK25(X0,X1),nil) = X1 ) ),
introduced(choice_axiom,[]) ).
fof(f280,plain,
! [X0,X1] :
( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ? [X4] :
( app(app(X3,X1),X4) = X0
& ssList(X4)
& ! [X5] :
( ~ lt(X2,X5)
| ~ ssItem(X5)
| ~ memberP(X3,X5) )
& ! [X6] :
( ~ lt(X6,X2)
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& cons(X2,nil) = X1 )
& ssList(X3) ) )
| ~ sP2(X0,X1) ),
inference(rectify,[],[f279]) ).
fof(f279,plain,
! [X3,X2] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( app(app(X5,X2),X6) = X3
& ssList(X6)
& ! [X8] :
( ~ lt(X4,X8)
| ~ ssItem(X8)
| ~ memberP(X5,X8) )
& ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& cons(X4,nil) = X2 )
& ssList(X5) ) )
| ~ sP2(X3,X2) ),
inference(nnf_transformation,[],[f227]) ).
fof(f1307,plain,
( nil = sK29
| ~ ssItem(sK25(sK29,sK28)) ),
inference(subsumption_resolution,[],[f1290,f800]) ).
fof(f1290,plain,
( ~ ssItem(sK25(sK29,sK28))
| nil = sK29
| duplicatefreeP(sK28) ),
inference(superposition,[],[f765,f1260]) ).
fof(f1260,plain,
( sK28 = cons(sK25(sK29,sK28),nil)
| nil = sK29 ),
inference(resolution,[],[f780,f687]) ).
fof(f780,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| cons(sK25(X0,X1),nil) = X1 ),
inference(literal_reordering,[],[f442]) ).
fof(f442,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| cons(sK25(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f284]) ).
fof(f765,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(literal_reordering,[],[f473]) ).
fof(f473,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,axiom,
! [X0] :
( ssItem(X0)
=> duplicatefreeP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax71) ).
fof(f1033,plain,
( ssItem(sK25(sK29,sK28))
| nil = sK28 ),
inference(resolution,[],[f723,f672]) ).
fof(f672,plain,
( sP2(sK29,sK28)
| nil = sK28 ),
inference(literal_reordering,[],[f575]) ).
fof(f575,plain,
( nil = sK28
| sP2(sK29,sK28) ),
inference(definition_unfolding,[],[f451,f453,f450,f453]) ).
fof(f451,plain,
( nil = sK30
| sP2(sK31,sK30) ),
inference(cnf_transformation,[],[f289]) ).
fof(f1599,plain,
( nil = sK28
| ~ ssItem(sK25(nil,sK28)) ),
inference(subsumption_resolution,[],[f1589,f800]) ).
fof(f1589,plain,
( duplicatefreeP(sK28)
| ~ ssItem(sK25(nil,sK28))
| nil = sK28 ),
inference(superposition,[],[f765,f1338]) ).
fof(f1338,plain,
( sK28 = cons(sK25(nil,sK28),nil)
| nil = sK28 ),
inference(resolution,[],[f1322,f780]) ).
fof(f1322,plain,
( sP2(nil,sK28)
| nil = sK28 ),
inference(backward_demodulation,[],[f672,f1308]) ).
fof(f800,plain,
~ duplicatefreeP(sK28),
inference(literal_reordering,[],[f454]) ).
fof(f454,plain,
~ duplicatefreeP(sK28),
inference(cnf_transformation,[],[f289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC179+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 18:24:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.48 % (13780)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.48 % (13782)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.49 % (13769)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (13796)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.51 % (13788)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.25/0.52 % (13773)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.25/0.52 % (13769)Refutation not found, incomplete strategy% (13769)------------------------------
% 1.25/0.52 % (13769)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.25/0.52 % (13769)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.25/0.52 % (13769)Termination reason: Refutation not found, incomplete strategy
% 1.25/0.52
% 1.25/0.52 % (13769)Memory used [KB]: 6012
% 1.25/0.52 % (13769)Time elapsed: 0.122 s
% 1.25/0.52 % (13769)Instructions burned: 19 (million)
% 1.25/0.52 % (13769)------------------------------
% 1.25/0.52 % (13769)------------------------------
% 1.25/0.52 % (13772)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.25/0.52 % (13774)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.25/0.53 % (13768)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.32/0.53 % (13782)First to succeed.
% 1.32/0.53 % (13771)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.32/0.53 % (13778)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.32/0.53 % (13797)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.32/0.53 % (13779)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.32/0.53 % (13782)Refutation found. Thanks to Tanya!
% 1.32/0.53 % SZS status Theorem for theBenchmark
% 1.32/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.32/0.53 % (13782)------------------------------
% 1.32/0.53 % (13782)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.53 % (13782)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.53 % (13782)Termination reason: Refutation
% 1.32/0.53
% 1.32/0.53 % (13782)Memory used [KB]: 6780
% 1.32/0.53 % (13782)Time elapsed: 0.054 s
% 1.32/0.53 % (13782)Instructions burned: 47 (million)
% 1.32/0.53 % (13782)------------------------------
% 1.32/0.53 % (13782)------------------------------
% 1.32/0.53 % (13764)Success in time 0.186 s
%------------------------------------------------------------------------------