TSTP Solution File: SWC029+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC029+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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 May 31 12:38:57 EDT 2023
% Result : Theorem 0.14s 0.32s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of formulae : 114 ( 12 unt; 0 def)
% Number of atoms : 377 ( 102 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 434 ( 171 ~; 160 |; 61 &)
% ( 22 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 17 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 85 (; 65 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
? [U] :
( ssItem(U)
& ? [V] :
( ssItem(V)
& U != V ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( memberP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(W,cons(V,X)) = U ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
! [U] :
( ssItem(U)
=> ~ memberP(nil,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != X
| app(Z,cons(Y,nil)) != W ) ) )
& neq(X,nil) )
| ( ( nil != V
| nil = U )
& ( nil != U
| nil = V ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != X
| app(Z,cons(Y,nil)) != W ) ) )
& neq(X,nil) )
| ( ( nil != V
| nil = U )
& ( nil != U
| nil = V ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f99,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| neq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f102,plain,
( ssItem(sk0_0)
& ssItem(sk0_1)
& sk0_0 != sk0_1 ),
inference(skolemization,[status(esa)],[f2]) ).
fof(f103,plain,
ssItem(sk0_0),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f106,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssItem(V)
| ( memberP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(W,cons(V,X)) = U ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f107,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssItem(V)
| ( ( ~ memberP(U,V)
| ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& app(W,cons(V,X)) = U ) ) )
& ( memberP(U,V)
| ! [W] :
( ~ ssList(W)
| ! [X] :
( ~ ssList(X)
| app(W,cons(V,X)) != U ) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f106]) ).
fof(f108,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssItem(V)
| ( ( ~ memberP(U,V)
| ( ssList(sk0_2(V,U))
& ssList(sk0_3(V,U))
& app(sk0_2(V,U),cons(V,sk0_3(V,U))) = U ) )
& ( memberP(U,V)
| ! [W] :
( ~ ssList(W)
| ! [X] :
( ~ ssList(X)
| app(W,cons(V,X)) != U ) ) ) ) ) ),
inference(skolemization,[status(esa)],[f107]) ).
fof(f112,plain,
! [X0,X1,X2,X3] :
( ~ ssList(X0)
| ~ ssItem(X1)
| memberP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ),
inference(cnf_transformation,[status(esa)],[f108]) ).
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(f220,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(f278,plain,
! [U] :
( ~ ssItem(U)
| ~ memberP(nil,U) ),
inference(pre_NNF_transformation,[status(esa)],[f38]) ).
fof(f279,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[status(esa)],[f278]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& app(cons(Y,nil),Z) = X
& app(Z,cons(Y,nil)) = W ) )
| ~ neq(X,nil) )
& ( ( nil = V
& nil != U )
| ( nil = U
& nil != V ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [U,V] :
( pd0_0(V,U)
=> ( nil = V
& nil != U ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& app(cons(Y,nil),Z) = X
& app(Z,cons(Y,nil)) = W ) )
| ~ neq(X,nil) )
& ( pd0_0(V,U)
| ( nil = U
& nil != V ) ) ) ) ) ),
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
& ( nil = sk0_49
| nil != sk0_50 )
& ( ( ssItem(sk0_51)
& ssList(sk0_52)
& app(cons(sk0_51,nil),sk0_52) = sk0_50
& app(sk0_52,cons(sk0_51,nil)) = sk0_49 )
| ~ neq(sk0_50,nil) )
& ( pd0_0(sk0_48,sk0_47)
| ( nil = sk0_47
& nil != sk0_48 ) ) ),
inference(skolemization,[status(esa)],[f417]) ).
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,
( nil = sk0_49
| nil != sk0_50 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
( ssItem(sk0_51)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
( ssList(sk0_52)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
( app(cons(sk0_51,nil),sk0_52) = sk0_50
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f429,plain,
( app(sk0_52,cons(sk0_51,nil)) = sk0_49
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f430,plain,
( pd0_0(sk0_48,sk0_47)
| nil = sk0_47 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f431,plain,
( pd0_0(sk0_48,sk0_47)
| nil != sk0_48 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f432,plain,
! [U,V] :
( ~ pd0_0(V,U)
| ( nil = V
& nil != U ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f433,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f432]) ).
fof(f434,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil != X1 ),
inference(cnf_transformation,[status(esa)],[f432]) ).
fof(f435,plain,
( spl0_0
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( nil = sk0_49
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_1
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f440,plain,
( nil != sk0_50
| spl0_1 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f425,f435,f438]) ).
fof(f442,plain,
( spl0_2
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f443,plain,
( ssItem(sk0_51)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( spl0_3
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f447,plain,
( ~ neq(sk0_50,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f445]) ).
fof(f448,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f426,f442,f445]) ).
fof(f449,plain,
( spl0_4
<=> ssList(sk0_52) ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f427,f449,f445]) ).
fof(f453,plain,
( spl0_5
<=> app(cons(sk0_51,nil),sk0_52) = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f456,plain,
( spl0_5
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f428,f453,f445]) ).
fof(f457,plain,
( spl0_6
<=> app(sk0_52,cons(sk0_51,nil)) = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f458,plain,
( app(sk0_52,cons(sk0_51,nil)) = sk0_49
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( spl0_6
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f429,f457,f445]) ).
fof(f461,plain,
( spl0_7
<=> pd0_0(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f462,plain,
( pd0_0(sk0_48,sk0_47)
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_8
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( nil = sk0_47
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f467,plain,
( spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f430,f461,f464]) ).
fof(f468,plain,
( spl0_9
<=> nil = sk0_48 ),
introduced(split_symbol_definition) ).
fof(f471,plain,
( spl0_7
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f431,f461,f468]) ).
fof(f472,plain,
! [X1] :
( ~ ssItem(X1)
| ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(esa)],[f100]) ).
fof(f473,plain,
! [X0] :
( ~ ssItem(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f472]) ).
fof(f474,plain,
! [X0,X1,X2] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| memberP(app(X0,cons(X1,X2)),X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(destructive_equality_resolution,[status(esa)],[f112]) ).
fof(f502,plain,
! [X0] : ~ pd0_0(X0,nil),
inference(destructive_equality_resolution,[status(esa)],[f434]) ).
fof(f511,plain,
! [X0] :
( ~ ssItem(X0)
| neq(X0,sk0_0)
| X0 = sk0_0 ),
inference(resolution,[status(thm)],[f103,f101]) ).
fof(f512,plain,
~ neq(sk0_0,sk0_0),
inference(resolution,[status(thm)],[f103,f473]) ).
fof(f518,plain,
( spl0_11
<=> sk0_0 = sk0_0 ),
introduced(split_symbol_definition) ).
fof(f531,plain,
( ~ neq(sk0_48,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f423,f447]) ).
fof(f532,plain,
( spl0_14
<=> ssList(sk0_48) ),
introduced(split_symbol_definition) ).
fof(f534,plain,
( ~ ssList(sk0_48)
| spl0_14 ),
inference(component_clause,[status(thm)],[f532]) ).
fof(f535,plain,
( spl0_15
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f537,plain,
( ~ ssList(nil)
| spl0_15 ),
inference(component_clause,[status(thm)],[f535]) ).
fof(f538,plain,
( ~ ssList(sk0_48)
| ~ ssList(nil)
| sk0_48 = nil
| spl0_3 ),
inference(resolution,[status(thm)],[f531,f220]) ).
fof(f539,plain,
( ~ spl0_14
| ~ spl0_15
| spl0_9
| spl0_3 ),
inference(split_clause,[status(thm)],[f538,f532,f535,f468,f445]) ).
fof(f540,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f537,f223]) ).
fof(f541,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f540]) ).
fof(f542,plain,
( nil != sk0_48
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f423,f440]) ).
fof(f543,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f534,f420]) ).
fof(f544,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f543]) ).
fof(f546,plain,
( app(sk0_52,cons(sk0_51,nil)) = sk0_47
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f424,f458]) ).
fof(f548,plain,
! [X0] :
( ~ ssItem(X0)
| neq(X0,sk0_51)
| X0 = sk0_51
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f443,f101]) ).
fof(f549,plain,
( ~ neq(sk0_51,sk0_51)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f443,f473]) ).
fof(f550,plain,
( nil = sk0_48
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f462,f433]) ).
fof(f551,plain,
( $false
| spl0_1
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f550,f542]) ).
fof(f552,plain,
( spl0_1
| ~ spl0_7 ),
inference(contradiction_clause,[status(thm)],[f551]) ).
fof(f553,plain,
( nil = sk0_47
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f436]) ).
fof(f563,plain,
( spl0_17
<=> sk0_51 = sk0_51 ),
introduced(split_symbol_definition) ).
fof(f576,plain,
( pd0_0(nil,sk0_47)
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f550,f462]) ).
fof(f577,plain,
( pd0_0(nil,nil)
| ~ spl0_0
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f553,f576]) ).
fof(f578,plain,
( $false
| ~ spl0_0
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f577,f502]) ).
fof(f579,plain,
( ~ spl0_0
| ~ spl0_7 ),
inference(contradiction_clause,[status(thm)],[f578]) ).
fof(f582,plain,
( ~ ssItem(sk0_51)
| sk0_51 = sk0_51
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f548,f549]) ).
fof(f583,plain,
( ~ spl0_2
| spl0_17 ),
inference(split_clause,[status(thm)],[f582,f442,f563]) ).
fof(f586,plain,
( app(sk0_52,cons(sk0_51,nil)) = nil
| ~ spl0_8
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f465,f546]) ).
fof(f604,plain,
( spl0_18
<=> ssItem(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f606,plain,
( ~ ssItem(sk0_0)
| spl0_18 ),
inference(component_clause,[status(thm)],[f604]) ).
fof(f607,plain,
( ~ ssItem(sk0_0)
| sk0_0 = sk0_0 ),
inference(resolution,[status(thm)],[f511,f512]) ).
fof(f608,plain,
( ~ spl0_18
| spl0_11 ),
inference(split_clause,[status(thm)],[f607,f604,f518]) ).
fof(f611,plain,
( $false
| spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f606,f103]) ).
fof(f612,plain,
spl0_18,
inference(contradiction_clause,[status(thm)],[f611]) ).
fof(f619,plain,
( spl0_19
<=> memberP(app(sk0_52,cons(sk0_51,nil)),sk0_51) ),
introduced(split_symbol_definition) ).
fof(f620,plain,
( memberP(app(sk0_52,cons(sk0_51,nil)),sk0_51)
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f619]) ).
fof(f622,plain,
( ~ ssList(nil)
| ~ ssItem(sk0_51)
| memberP(app(sk0_52,cons(sk0_51,nil)),sk0_51)
| ~ ssList(sk0_52)
| ~ ssList(nil)
| ~ spl0_8
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f586,f474]) ).
fof(f623,plain,
( ~ spl0_15
| ~ spl0_2
| spl0_19
| ~ spl0_4
| ~ spl0_8
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f622,f535,f442,f619,f449,f464,f457]) ).
fof(f624,plain,
( memberP(nil,sk0_51)
| ~ spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(forward_demodulation,[status(thm)],[f586,f620]) ).
fof(f625,plain,
( ~ ssItem(sk0_51)
| ~ spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(resolution,[status(thm)],[f624,f279]) ).
fof(f626,plain,
( $false
| ~ spl0_2
| ~ spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f625,f443]) ).
fof(f627,plain,
( ~ spl0_2
| ~ spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(contradiction_clause,[status(thm)],[f626]) ).
fof(f628,plain,
$false,
inference(sat_refutation,[status(thm)],[f441,f448,f452,f456,f460,f467,f471,f539,f541,f544,f552,f579,f583,f608,f612,f623,f627]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC029+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n027.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue May 30 11:43:17 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.14/0.32 % Refutation found
% 0.14/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.54 % Elapsed time: 0.022767 seconds
% 0.14/0.54 % CPU time: 0.020387 seconds
% 0.14/0.54 % Memory used: 4.155 MB
%------------------------------------------------------------------------------