TSTP Solution File: SWV374+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.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 : n018.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:45:21 EDT 2022
% Result : Theorem 0.18s 0.54s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 9 unt; 0 def)
% Number of atoms : 166 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 160 ( 56 ~; 74 |; 16 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 87 ( 81 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f262,plain,
$false,
inference(avatar_sat_refutation,[],[f192,f198,f204,f246,f261]) ).
fof(f261,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f259]) ).
fof(f259,plain,
( $false
| ~ spl3_4 ),
inference(resolution,[],[f254,f158]) ).
fof(f158,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| create_slb = sK1
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f88,f116]) ).
fof(f116,plain,
( ? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0)) ) )
=> ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| create_slb = sK1
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0)) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,negated_conjecture,
~ ! [X2,X1,X0] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[],[f42]) ).
fof(f42,conjecture,
! [X2,X1,X0] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_co) ).
fof(f254,plain,
( ! [X0] : ~ ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_4 ),
inference(superposition,[],[f155,f197]) ).
fof(f197,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f196,plain,
( spl3_4
<=> ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f155,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f66]) ).
fof(f66,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( $false
<=> ok(triple(X0,X1,bad)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f246,plain,
( spl3_4
| ~ spl3_1
| spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f245,f189,f185,f181,f196]) ).
fof(f181,plain,
( spl3_1
<=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f185,plain,
( spl3_2
<=> less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f189,plain,
( spl3_3
<=> create_slb = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f245,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| ~ spl3_1
| spl3_2
| spl3_3 ),
inference(subsumption_resolution,[],[f244,f190]) ).
fof(f190,plain,
( create_slb != sK1
| spl3_3 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f244,plain,
( ! [X0] :
( findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| create_slb = sK1 )
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f241,f182]) ).
fof(f182,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f241,plain,
( ! [X0] :
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| spl3_2 ),
inference(resolution,[],[f229,f166]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X0))
| ~ contains_slb(X2,findmin_pqp_res(X1))
| create_slb = X2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0,X1,X2] :
( create_slb = X2
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X2,X0))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
! [X0,X3,X1] :
( create_slb = X1
| ~ strictly_less_than(findmin_pqp_res(X3),lookup_slb(X1,findmin_pqp_res(X3)))
| triple(X3,update_slb(X1,findmin_pqp_res(X3)),bad) = findmin_cpq_eff(triple(X3,X1,X0))
| ~ contains_slb(X1,findmin_pqp_res(X3)) ),
inference(flattening,[],[f75]) ).
fof(f75,plain,
! [X1,X3,X0] :
( triple(X3,update_slb(X1,findmin_pqp_res(X3)),bad) = findmin_cpq_eff(triple(X3,X1,X0))
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X3))
| ~ strictly_less_than(findmin_pqp_res(X3),lookup_slb(X1,findmin_pqp_res(X3))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,plain,
! [X1,X3,X0] :
( ( create_slb != X1
& contains_slb(X1,findmin_pqp_res(X3))
& strictly_less_than(findmin_pqp_res(X3),lookup_slb(X1,findmin_pqp_res(X3))) )
=> triple(X3,update_slb(X1,findmin_pqp_res(X3)),bad) = findmin_cpq_eff(triple(X3,X1,X0)) ),
inference(rectify,[],[f36]) ).
fof(f36,axiom,
! [X2,X1,X3,X0] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& create_slb != X1
& contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(f229,plain,
( strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| spl3_2 ),
inference(subsumption_resolution,[],[f227,f187]) ).
fof(f187,plain,
( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f227,plain,
( strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| spl3_2 ),
inference(resolution,[],[f225,f154]) ).
fof(f154,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| strictly_less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| strictly_less_than(X1,X0)
| less_than(X0,X1) ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
! [X1,X0] :
( ~ less_than(X0,X1)
| strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
<=> strictly_less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f225,plain,
( less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| spl3_2 ),
inference(resolution,[],[f187,f149]) ).
fof(f149,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f204,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f203]) ).
fof(f203,plain,
( $false
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f202,f155]) ).
fof(f202,plain,
( ok(triple(sK0,create_slb,bad))
| ~ spl3_3 ),
inference(forward_demodulation,[],[f201,f141]) ).
fof(f141,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f201,plain,
( ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
| ~ spl3_3 ),
inference(backward_demodulation,[],[f158,f191]) ).
fof(f191,plain,
( create_slb = sK1
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f198,plain,
( spl3_4
| spl3_3
| spl3_1 ),
inference(avatar_split_clause,[],[f193,f181,f189,f196]) ).
fof(f193,plain,
( ! [X0] :
( create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| spl3_1 ),
inference(resolution,[],[f183,f165]) ).
fof(f165,plain,
! [X2,X0,X1] :
( contains_slb(X0,findmin_pqp_res(X2))
| create_slb = X0
| findmin_cpq_eff(triple(X2,X0,X1)) = triple(X2,update_slb(X0,findmin_pqp_res(X2)),bad) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0,X1,X2] :
( create_slb = X0
| findmin_cpq_eff(triple(X2,X0,X1)) = triple(X2,update_slb(X0,findmin_pqp_res(X2)),bad)
| contains_slb(X0,findmin_pqp_res(X2)) ),
inference(rectify,[],[f85]) ).
fof(f85,plain,
! [X2,X3,X0] :
( create_slb = X2
| findmin_cpq_eff(triple(X0,X2,X3)) = triple(X0,update_slb(X2,findmin_pqp_res(X0)),bad)
| contains_slb(X2,findmin_pqp_res(X0)) ),
inference(flattening,[],[f84]) ).
fof(f84,plain,
! [X3,X2,X0] :
( findmin_cpq_eff(triple(X0,X2,X3)) = triple(X0,update_slb(X2,findmin_pqp_res(X0)),bad)
| contains_slb(X2,findmin_pqp_res(X0))
| create_slb = X2 ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,plain,
! [X3,X2,X0] :
( ( ~ contains_slb(X2,findmin_pqp_res(X0))
& create_slb != X2 )
=> findmin_cpq_eff(triple(X0,X2,X3)) = triple(X0,update_slb(X2,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X0,X3,X1,X2] :
( ( create_slb != X1
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
fof(f183,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| spl3_1 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f192,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f157,f189,f185,f181]) ).
fof(f157,plain,
( create_slb = sK1
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(cnf_transformation,[],[f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 19:28:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (30999)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.18/0.48 % (31000)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.18/0.50 % (31007)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)
% 0.18/0.50 % (31016)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.18/0.50 % (30995)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.18/0.51 % (31015)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)
% 0.18/0.51 % (31017)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)
% 0.18/0.51 % (31008)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.18/0.51 % (31008)Instruction limit reached!
% 0.18/0.51 % (31008)------------------------------
% 0.18/0.51 % (31008)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (31009)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.18/0.52 % (30997)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.18/0.52 % (31000)Instruction limit reached!
% 0.18/0.52 % (31000)------------------------------
% 0.18/0.52 % (31000)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (31008)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (31008)Termination reason: Unknown
% 0.18/0.52 % (31008)Termination phase: Property scanning
% 0.18/0.52
% 0.18/0.52 % (31008)Memory used [KB]: 1535
% 0.18/0.52 % (31008)Time elapsed: 0.005 s
% 0.18/0.52 % (31008)Instructions burned: 3 (million)
% 0.18/0.52 % (31008)------------------------------
% 0.18/0.52 % (31008)------------------------------
% 0.18/0.52 % (31009)Instruction limit reached!
% 0.18/0.52 % (31009)------------------------------
% 0.18/0.52 % (31009)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (31000)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (31000)Termination reason: Unknown
% 0.18/0.52 % (31000)Termination phase: Saturation
% 0.18/0.52
% 0.18/0.52 % (31000)Memory used [KB]: 6012
% 0.18/0.52 % (31000)Time elapsed: 0.116 s
% 0.18/0.52 % (31000)Instructions burned: 39 (million)
% 0.18/0.52 % (31000)------------------------------
% 0.18/0.52 % (31000)------------------------------
% 0.18/0.52 % (30994)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.18/0.53 % (30999)Instruction limit reached!
% 0.18/0.53 % (30999)------------------------------
% 0.18/0.53 % (30999)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (30999)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (30999)Termination reason: Unknown
% 0.18/0.53 % (30999)Termination phase: Saturation
% 0.18/0.53
% 0.18/0.53 % (30999)Memory used [KB]: 1663
% 0.18/0.53 % (30999)Time elapsed: 0.141 s
% 0.18/0.53 % (30999)Instructions burned: 16 (million)
% 0.18/0.53 % (30999)------------------------------
% 0.18/0.53 % (30999)------------------------------
% 0.18/0.53 % (30995)First to succeed.
% 0.18/0.53 % (30996)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.18/0.53 % (30996)Instruction limit reached!
% 0.18/0.53 % (30996)------------------------------
% 0.18/0.53 % (30996)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (30996)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (30996)Termination reason: Unknown
% 0.18/0.53 % (30996)Termination phase: Saturation
% 0.18/0.53
% 0.18/0.53 % (30996)Memory used [KB]: 1535
% 0.18/0.53 % (30996)Time elapsed: 0.005 s
% 0.18/0.53 % (30996)Instructions burned: 4 (million)
% 0.18/0.53 % (30996)------------------------------
% 0.18/0.53 % (30996)------------------------------
% 0.18/0.53 % (31001)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.18/0.53 % (31015)Also succeeded, but the first one will report.
% 0.18/0.54 % (30995)Refutation found. Thanks to Tanya!
% 0.18/0.54 % SZS status Theorem for theBenchmark
% 0.18/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.54 % (30995)------------------------------
% 0.18/0.54 % (30995)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54 % (30995)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54 % (30995)Termination reason: Refutation
% 0.18/0.54
% 0.18/0.54 % (30995)Memory used [KB]: 6140
% 0.18/0.54 % (30995)Time elapsed: 0.144 s
% 0.18/0.54 % (30995)Instructions burned: 7 (million)
% 0.18/0.54 % (30995)------------------------------
% 0.18/0.54 % (30995)------------------------------
% 0.18/0.54 % (30993)Success in time 0.202 s
%------------------------------------------------------------------------------