TSTP Solution File: SWC384+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC384+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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 Apr 30 20:45:35 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 96 ( 11 unt; 0 def)
% Number of atoms : 371 ( 61 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 440 ( 165 ~; 158 |; 80 &)
% ( 17 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 12 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 113 ( 84 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [U] :
( ssList(U)
=> ( singletonP(U)
<=> ? [V] :
( ssItem(V)
& cons(V,nil) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(app(W,V),X) = U ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( cons(Y,nil) != W
| app(app(Z,W),X1) != X
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) ) )
& ( nil != X
| nil != W ) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( cons(Y,nil) != W
| app(app(Z,W),X1) != X
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) ) )
& ( nil != X
| nil != W ) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f113,plain,
! [U] :
( ~ ssList(U)
| ( singletonP(U)
<=> ? [V] :
( ssItem(V)
& cons(V,nil) = U ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f114,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ singletonP(U)
| ? [V] :
( ssItem(V)
& cons(V,nil) = U ) )
& ( singletonP(U)
| ! [V] :
( ~ ssItem(V)
| cons(V,nil) != U ) ) ) ),
inference(NNF_transformation,[status(esa)],[f113]) ).
fof(f115,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ singletonP(U)
| ( ssItem(sk0_4(U))
& cons(sk0_4(U),nil) = U ) )
& ( singletonP(U)
| ! [V] :
( ~ ssItem(V)
| cons(V,nil) != U ) ) ) ),
inference(skolemization,[status(esa)],[f114]) ).
fof(f118,plain,
! [X0,X1] :
( ~ ssList(X0)
| singletonP(X0)
| ~ ssItem(X1)
| cons(X1,nil) != X0 ),
inference(cnf_transformation,[status(esa)],[f115]) ).
fof(f131,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( segmentP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(app(W,V),X) = U ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f132,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ segmentP(U,V)
| ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(app(W,V),X) = U ) ) )
& ( segmentP(U,V)
| ! [W] :
( ~ ssList(W)
| ! [X] :
( ~ ssList(X)
| app(app(W,V),X) != U ) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f131]) ).
fof(f133,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ segmentP(U,V)
| ( ssList(sk0_7(V,U))
& ssList(sk0_8(V,U))
& app(app(sk0_7(V,U),V),sk0_8(V,U)) = U ) )
& ( segmentP(U,V)
| ! [W] :
( ~ ssList(W)
| ! [X] :
( ~ ssList(X)
| app(app(W,V),X) != U ) ) ) ) ) ),
inference(skolemization,[status(esa)],[f132]) ).
fof(f137,plain,
! [X0,X1,X2,X3] :
( ~ ssList(X0)
| ~ ssList(X1)
| segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ),
inference(cnf_transformation,[status(esa)],[f133]) ).
fof(f217,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f218,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f217]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& neq(V,nil)
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) )
| ( nil = X
& nil = W ) )
& ( ~ singletonP(U)
| ~ segmentP(V,U) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [W,X,Y] :
( pd0_0(Y,X,W)
=> ( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& neq(V,nil)
& ( ? [Y] : pd0_0(Y,X,W)
| ( nil = X
& nil = W ) )
& ( ~ singletonP(U)
| ~ segmentP(V,U) ) ) ) ) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& neq(sk0_48,nil)
& ( pd0_0(sk0_51,sk0_50,sk0_49)
| ( nil = sk0_50
& nil = sk0_49 ) )
& ( ~ singletonP(sk0_47)
| ~ segmentP(sk0_48,sk0_47) ) ),
inference(skolemization,[status(esa)],[f417]) ).
fof(f419,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f420,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f423,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f424,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f425,plain,
neq(sk0_48,nil),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| nil = sk0_50 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
( ~ singletonP(sk0_47)
| ~ segmentP(sk0_48,sk0_47) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f429,plain,
! [W,X,Y] :
( ~ pd0_0(Y,X,W)
| ( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
! [W,X,Y] :
( ~ pd0_0(Y,X,W)
| ( ssItem(Y)
& ssList(sk0_52(Y,X,W))
& ssList(sk0_53(Y,X,W))
& cons(Y,nil) = W
& app(app(sk0_52(Y,X,W),W),sk0_53(Y,X,W)) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(sk0_52(Y,X,W),X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(sk0_53(Y,X,W),X3)
| ~ lt(X3,Y) ) ) ),
inference(skolemization,[status(esa)],[f429]) ).
fof(f431,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f430]) ).
fof(f432,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| ssList(sk0_52(X0,X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f430]) ).
fof(f433,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| ssList(sk0_53(X0,X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f430]) ).
fof(f434,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| cons(X0,nil) = X2 ),
inference(cnf_transformation,[status(esa)],[f430]) ).
fof(f435,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| app(app(sk0_52(X0,X1,X2),X2),sk0_53(X0,X1,X2)) = X1 ),
inference(cnf_transformation,[status(esa)],[f430]) ).
fof(f438,plain,
( spl0_0
<=> pd0_0(sk0_51,sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_1
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f442,plain,
( nil = sk0_50
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f426,f438,f441]) ).
fof(f449,plain,
( spl0_3
<=> singletonP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( spl0_4
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f454,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_4 ),
inference(component_clause,[status(thm)],[f452]) ).
fof(f455,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f428,f449,f452]) ).
fof(f459,plain,
! [X0] :
( ~ ssList(cons(X0,nil))
| singletonP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(destructive_equality_resolution,[status(esa)],[f118]) ).
fof(f462,plain,
! [X0,X1,X2] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X1)
| segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(destructive_equality_resolution,[status(esa)],[f137]) ).
fof(f471,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(esa)],[f219]) ).
fof(f472,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f471]) ).
fof(f494,plain,
( pd0_0(sk0_51,sk0_48,sk0_49)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f439]) ).
fof(f495,plain,
( pd0_0(sk0_51,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f494]) ).
fof(f496,plain,
( ssItem(sk0_51)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f431,f495]) ).
fof(f500,plain,
( spl0_5
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f502,plain,
( ~ ssItem(sk0_51)
| spl0_5 ),
inference(component_clause,[status(thm)],[f500]) ).
fof(f513,plain,
( nil = sk0_48
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f423,f442]) ).
fof(f515,plain,
( neq(nil,nil)
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f513,f425]) ).
fof(f526,plain,
( $false
| spl0_5
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f496,f502]) ).
fof(f527,plain,
( spl0_5
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f526]) ).
fof(f534,plain,
( ~ ssList(nil)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f515,f472]) ).
fof(f535,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f534,f223]) ).
fof(f536,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f535]) ).
fof(f542,plain,
( cons(sk0_51,nil) = sk0_47
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f434,f495]) ).
fof(f543,plain,
( app(app(sk0_52(sk0_51,sk0_48,sk0_47),sk0_47),sk0_53(sk0_51,sk0_48,sk0_47)) = sk0_48
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f435,f495]) ).
fof(f574,plain,
( spl0_10
<=> ssList(sk0_48) ),
introduced(split_symbol_definition) ).
fof(f576,plain,
( ~ ssList(sk0_48)
| spl0_10 ),
inference(component_clause,[status(thm)],[f574]) ).
fof(f582,plain,
( spl0_12
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f584,plain,
( ~ ssList(sk0_47)
| spl0_12 ),
inference(component_clause,[status(thm)],[f582]) ).
fof(f604,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f576,f420]) ).
fof(f605,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f604]) ).
fof(f606,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f584,f419]) ).
fof(f607,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f606]) ).
fof(f637,plain,
( spl0_18
<=> ssList(cons(sk0_51,nil)) ),
introduced(split_symbol_definition) ).
fof(f639,plain,
( ~ ssList(cons(sk0_51,nil))
| spl0_18 ),
inference(component_clause,[status(thm)],[f637]) ).
fof(f640,plain,
( ~ ssList(cons(sk0_51,nil))
| singletonP(sk0_47)
| ~ ssItem(sk0_51)
| ~ spl0_0 ),
inference(paramodulation,[status(thm)],[f542,f459]) ).
fof(f641,plain,
( ~ spl0_18
| spl0_3
| ~ spl0_5
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f640,f637,f449,f500,f438]) ).
fof(f647,plain,
( ~ ssList(sk0_47)
| ~ spl0_0
| spl0_18 ),
inference(forward_demodulation,[status(thm)],[f542,f639]) ).
fof(f648,plain,
( $false
| ~ spl0_0
| spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f647,f419]) ).
fof(f649,plain,
( ~ spl0_0
| spl0_18 ),
inference(contradiction_clause,[status(thm)],[f648]) ).
fof(f666,plain,
( spl0_22
<=> segmentP(app(app(sk0_52(sk0_51,sk0_48,sk0_47),sk0_47),sk0_53(sk0_51,sk0_48,sk0_47)),sk0_47) ),
introduced(split_symbol_definition) ).
fof(f667,plain,
( segmentP(app(app(sk0_52(sk0_51,sk0_48,sk0_47),sk0_47),sk0_53(sk0_51,sk0_48,sk0_47)),sk0_47)
| ~ spl0_22 ),
inference(component_clause,[status(thm)],[f666]) ).
fof(f669,plain,
( spl0_23
<=> ssList(sk0_52(sk0_51,sk0_48,sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f671,plain,
( ~ ssList(sk0_52(sk0_51,sk0_48,sk0_47))
| spl0_23 ),
inference(component_clause,[status(thm)],[f669]) ).
fof(f672,plain,
( spl0_24
<=> ssList(sk0_53(sk0_51,sk0_48,sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f674,plain,
( ~ ssList(sk0_53(sk0_51,sk0_48,sk0_47))
| spl0_24 ),
inference(component_clause,[status(thm)],[f672]) ).
fof(f675,plain,
( ~ ssList(sk0_48)
| ~ ssList(sk0_47)
| segmentP(app(app(sk0_52(sk0_51,sk0_48,sk0_47),sk0_47),sk0_53(sk0_51,sk0_48,sk0_47)),sk0_47)
| ~ ssList(sk0_52(sk0_51,sk0_48,sk0_47))
| ~ ssList(sk0_53(sk0_51,sk0_48,sk0_47))
| ~ spl0_0 ),
inference(paramodulation,[status(thm)],[f543,f462]) ).
fof(f676,plain,
( ~ spl0_10
| ~ spl0_12
| spl0_22
| ~ spl0_23
| ~ spl0_24
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f675,f574,f582,f666,f669,f672,f438]) ).
fof(f710,plain,
( ~ pd0_0(sk0_51,sk0_48,sk0_47)
| spl0_23 ),
inference(resolution,[status(thm)],[f671,f432]) ).
fof(f711,plain,
( $false
| ~ spl0_0
| spl0_23 ),
inference(forward_subsumption_resolution,[status(thm)],[f710,f495]) ).
fof(f712,plain,
( ~ spl0_0
| spl0_23 ),
inference(contradiction_clause,[status(thm)],[f711]) ).
fof(f713,plain,
( ~ pd0_0(sk0_51,sk0_48,sk0_47)
| spl0_24 ),
inference(resolution,[status(thm)],[f674,f433]) ).
fof(f714,plain,
( $false
| ~ spl0_0
| spl0_24 ),
inference(forward_subsumption_resolution,[status(thm)],[f713,f495]) ).
fof(f715,plain,
( ~ spl0_0
| spl0_24 ),
inference(contradiction_clause,[status(thm)],[f714]) ).
fof(f716,plain,
( segmentP(sk0_48,sk0_47)
| ~ spl0_0
| ~ spl0_22 ),
inference(forward_demodulation,[status(thm)],[f543,f667]) ).
fof(f717,plain,
( $false
| spl0_4
| ~ spl0_0
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[status(thm)],[f716,f454]) ).
fof(f718,plain,
( spl0_4
| ~ spl0_0
| ~ spl0_22 ),
inference(contradiction_clause,[status(thm)],[f717]) ).
fof(f719,plain,
$false,
inference(sat_refutation,[status(thm)],[f444,f455,f527,f536,f605,f607,f641,f649,f676,f712,f715,f718]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC384+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 00:31:17 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.37 % Drodi V3.6.0
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.39 % Elapsed time: 0.038809 seconds
% 0.19/0.39 % CPU time: 0.068618 seconds
% 0.19/0.39 % Total memory used: 14.859 MB
% 0.19/0.39 % Net memory used: 14.834 MB
%------------------------------------------------------------------------------