TSTP Solution File: SWC294+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC294+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 05:10:02 EDT 2024
% Result : Theorem 0.22s 0.42s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 22
% Syntax : Number of formulae : 92 ( 15 unt; 0 def)
% Number of atoms : 337 ( 78 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 371 ( 126 ~; 120 |; 89 &)
% ( 15 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 77 ( 48 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1127,plain,
$false,
inference(avatar_sat_refutation,[],[f649,f769,f839,f1046,f1068,f1086,f1126]) ).
fof(f1126,plain,
~ spl69_2,
inference(avatar_contradiction_clause,[],[f1125]) ).
fof(f1125,plain,
( $false
| ~ spl69_2 ),
inference(subsumption_resolution,[],[f1124,f373]) ).
fof(f373,plain,
ssList(sK18),
inference(cnf_transformation,[],[f253]) ).
fof(f253,plain,
( ( ~ neq(sK21,nil)
| singletonP(sK20) )
& ~ strictorderedP(sK18)
& segmentP(sK21,sK20)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f98,f252,f251,f250,f249]) ).
fof(f249,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK18)
& segmentP(X3,X2)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK18)
& segmentP(X3,X2)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK18)
& segmentP(X3,X2)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK18)
& segmentP(X3,X2)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK20) )
& ~ strictorderedP(sK18)
& segmentP(X3,sK20)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK20) )
& ~ strictorderedP(sK18)
& segmentP(X3,sK20)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ neq(sK21,nil)
| singletonP(sK20) )
& ~ strictorderedP(sK18)
& segmentP(sK21,sK20)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& segmentP(X3,X2)
& X0 = X2
& X1 = 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] :
( ( neq(X3,nil)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| 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)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1124,plain,
( ~ ssList(sK18)
| ~ spl69_2 ),
inference(subsumption_resolution,[],[f1123,f648]) ).
fof(f648,plain,
( singletonP(sK18)
| ~ spl69_2 ),
inference(avatar_component_clause,[],[f646]) ).
fof(f646,plain,
( spl69_2
<=> singletonP(sK18) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_2])]) ).
fof(f1123,plain,
( ~ singletonP(sK18)
| ~ ssList(sK18)
| ~ spl69_2 ),
inference(resolution,[],[f1117,f464]) ).
fof(f464,plain,
! [X0] :
( ssItem(sK26(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f283]) ).
fof(f283,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK26(X0),nil) = X0
& ssItem(sK26(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26])],[f281,f282]) ).
fof(f282,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK26(X0),nil) = X0
& ssItem(sK26(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f280]) ).
fof(f280,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f159]) ).
fof(f159,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f1117,plain,
( ~ ssItem(sK26(sK18))
| ~ spl69_2 ),
inference(subsumption_resolution,[],[f1107,f380]) ).
fof(f380,plain,
~ strictorderedP(sK18),
inference(cnf_transformation,[],[f253]) ).
fof(f1107,plain,
( strictorderedP(sK18)
| ~ ssItem(sK26(sK18))
| ~ spl69_2 ),
inference(superposition,[],[f401,f1095]) ).
fof(f1095,plain,
( sK18 = cons(sK26(sK18),nil)
| ~ spl69_2 ),
inference(subsumption_resolution,[],[f1094,f373]) ).
fof(f1094,plain,
( sK18 = cons(sK26(sK18),nil)
| ~ ssList(sK18)
| ~ spl69_2 ),
inference(resolution,[],[f648,f465]) ).
fof(f465,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK26(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f283]) ).
fof(f401,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f1086,plain,
~ spl69_7,
inference(avatar_contradiction_clause,[],[f1085]) ).
fof(f1085,plain,
( $false
| ~ spl69_7 ),
inference(subsumption_resolution,[],[f1074,f389]) ).
fof(f389,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f1074,plain,
( ~ strictorderedP(nil)
| ~ spl69_7 ),
inference(superposition,[],[f380,f838]) ).
fof(f838,plain,
( nil = sK18
| ~ spl69_7 ),
inference(avatar_component_clause,[],[f836]) ).
fof(f836,plain,
( spl69_7
<=> nil = sK18 ),
introduced(avatar_definition,[new_symbols(naming,[spl69_7])]) ).
fof(f1068,plain,
( ~ spl69_5
| spl69_7 ),
inference(avatar_contradiction_clause,[],[f1067]) ).
fof(f1067,plain,
( $false
| ~ spl69_5
| spl69_7 ),
inference(subsumption_resolution,[],[f1066,f373]) ).
fof(f1066,plain,
( ~ ssList(sK18)
| ~ spl69_5
| spl69_7 ),
inference(subsumption_resolution,[],[f1065,f837]) ).
fof(f837,plain,
( nil != sK18
| spl69_7 ),
inference(avatar_component_clause,[],[f836]) ).
fof(f1065,plain,
( nil = sK18
| ~ ssList(sK18)
| ~ spl69_5 ),
inference(resolution,[],[f1056,f550]) ).
fof(f550,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f348]) ).
fof(f348,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f1056,plain,
( segmentP(nil,sK18)
| ~ spl69_5 ),
inference(superposition,[],[f638,f768]) ).
fof(f768,plain,
( nil = sK19
| ~ spl69_5 ),
inference(avatar_component_clause,[],[f766]) ).
fof(f766,plain,
( spl69_5
<=> nil = sK19 ),
introduced(avatar_definition,[new_symbols(naming,[spl69_5])]) ).
fof(f638,plain,
segmentP(sK19,sK18),
inference(forward_demodulation,[],[f637,f377]) ).
fof(f377,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f253]) ).
fof(f637,plain,
segmentP(sK21,sK18),
inference(forward_demodulation,[],[f379,f378]) ).
fof(f378,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f253]) ).
fof(f379,plain,
segmentP(sK21,sK20),
inference(cnf_transformation,[],[f253]) ).
fof(f1046,plain,
( spl69_1
| spl69_5 ),
inference(avatar_contradiction_clause,[],[f1045]) ).
fof(f1045,plain,
( $false
| spl69_1
| spl69_5 ),
inference(subsumption_resolution,[],[f1044,f374]) ).
fof(f374,plain,
ssList(sK19),
inference(cnf_transformation,[],[f253]) ).
fof(f1044,plain,
( ~ ssList(sK19)
| spl69_1
| spl69_5 ),
inference(subsumption_resolution,[],[f1043,f390]) ).
fof(f390,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1043,plain,
( ~ ssList(nil)
| ~ ssList(sK19)
| spl69_1
| spl69_5 ),
inference(subsumption_resolution,[],[f1042,f767]) ).
fof(f767,plain,
( nil != sK19
| spl69_5 ),
inference(avatar_component_clause,[],[f766]) ).
fof(f1042,plain,
( nil = sK19
| ~ ssList(nil)
| ~ ssList(sK19)
| spl69_1 ),
inference(resolution,[],[f570,f644]) ).
fof(f644,plain,
( ~ neq(sK19,nil)
| spl69_1 ),
inference(avatar_component_clause,[],[f642]) ).
fof(f642,plain,
( spl69_1
<=> neq(sK19,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_1])]) ).
fof(f570,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f354]) ).
fof(f354,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f839,plain,
( spl69_6
| spl69_7 ),
inference(avatar_split_clause,[],[f797,f836,f832]) ).
fof(f832,plain,
( spl69_6
<=> hd(sK18) = sK24(sK18) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_6])]) ).
fof(f797,plain,
( nil = sK18
| hd(sK18) = sK24(sK18) ),
inference(resolution,[],[f461,f373]) ).
fof(f461,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| hd(X0) = sK24(X0) ),
inference(cnf_transformation,[],[f277]) ).
fof(f277,plain,
! [X0] :
( ( hd(X0) = sK24(X0)
& ssItem(sK24(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK24])],[f156,f276]) ).
fof(f276,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK24(X0)
& ssItem(sK24(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f155]) ).
fof(f155,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax75) ).
fof(f769,plain,
( ~ spl69_3
| ~ spl69_4
| spl69_5
| spl69_1 ),
inference(avatar_split_clause,[],[f756,f642,f766,f762,f758]) ).
fof(f758,plain,
( spl69_3
<=> ssItem(sK19) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_3])]) ).
fof(f762,plain,
( spl69_4
<=> ssItem(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_4])]) ).
fof(f756,plain,
( nil = sK19
| ~ ssItem(nil)
| ~ ssItem(sK19)
| spl69_1 ),
inference(resolution,[],[f408,f644]) ).
fof(f408,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f649,plain,
( ~ spl69_1
| spl69_2 ),
inference(avatar_split_clause,[],[f640,f646,f642]) ).
fof(f640,plain,
( singletonP(sK18)
| ~ neq(sK19,nil) ),
inference(forward_demodulation,[],[f639,f378]) ).
fof(f639,plain,
( ~ neq(sK19,nil)
| singletonP(sK20) ),
inference(forward_demodulation,[],[f381,f377]) ).
fof(f381,plain,
( ~ neq(sK21,nil)
| singletonP(sK20) ),
inference(cnf_transformation,[],[f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC294+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 02:46:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (27290)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (27297)WARNING: value z3 for option sas not known
% 0.22/0.38 % (27296)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.38 % (27295)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.38 % (27298)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 % (27297)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38 % (27299)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.38 % (27301)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.39 % (27300)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [2]
% 0.22/0.40 TRYING [2]
% 0.22/0.41 TRYING [3]
% 0.22/0.41 TRYING [3]
% 0.22/0.42 % (27297)First to succeed.
% 0.22/0.42 % (27297)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27290"
% 0.22/0.42 % (27297)Refutation found. Thanks to Tanya!
% 0.22/0.42 % SZS status Theorem for theBenchmark
% 0.22/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.42 % (27297)------------------------------
% 0.22/0.42 % (27297)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.42 % (27297)Termination reason: Refutation
% 0.22/0.42
% 0.22/0.42 % (27297)Memory used [KB]: 1703
% 0.22/0.42 % (27297)Time elapsed: 0.040 s
% 0.22/0.42 % (27297)Instructions burned: 58 (million)
% 0.22/0.42 % (27290)Success in time 0.06 s
%------------------------------------------------------------------------------