%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC397-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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 5 05:19:30 PM UTC 2026
% Result : Unsatisfiable 2.05s 1.92s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 29
% Syntax : Number of clauses : 98 ( 32 unt; 11 nHn; 87 RR)
% Number of literals : 248 ( 37 equ; 151 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 113 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_13,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(co1_14,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause158,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause158) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_0_29,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_30,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_31,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_33,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_36,negated_conjecture,
( memberP(nil,sk5)
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_38,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
co1_13 ).
cnf(c_0_39,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_44,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_45,negated_conjecture,
app(cons(sk6,nil),sk7) = sk3,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_46,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_47,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_49,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_50,negated_conjecture,
cons(sk6,sk7) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_51,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_52,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_53,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_54,negated_conjecture,
( cons(sk6,app(sk7,X1)) = app(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_47]),c_0_48])]) ).
cnf(c_0_55,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_56,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_57,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( ssList(app(sk3,X1))
| ~ ssList(app(sk7,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_47])]) ).
cnf(c_0_59,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_60,negated_conjecture,
app(sk7,cons(sk6,nil)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_39]),c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_61,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_40]) ).
cnf(c_0_62,negated_conjecture,
( ssList(app(sk3,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_52]),c_0_48])]) ).
cnf(c_0_63,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(app(sk4,cons(sk6,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk4,cons(sk6,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_47]),c_0_41]),c_0_48])]) ).
cnf(c_0_65,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,app(sk3,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
app(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_63]),c_0_50]),c_0_41]),c_0_48])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(app(sk4,sk3))
| ~ duplicatefreeP(app(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_50]),c_0_48])]) ).
cnf(c_0_68,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,sk3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_41]),c_0_66]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_70,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,sk3)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_69,c_0_30]) ).
cnf(c_0_72,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_73,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_52]),c_0_40]),c_0_71])]) ).
cnf(c_0_74,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_75,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X2,X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_76,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_77,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_78,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_79,negated_conjecture,
( app(sk7,app(cons(sk6,nil),X1)) = app(sk4,X1)
| ~ ssList(cons(sk6,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_60]),c_0_48])]) ).
cnf(c_0_80,plain,
( memberP(X1,X2)
| ~ memberP(X3,X2)
| ~ rearsegP(X1,X3)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]) ).
cnf(c_0_81,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_52]) ).
cnf(c_0_82,negated_conjecture,
( app(sk7,sk3) = app(sk4,sk7)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_45]),c_0_48])]) ).
cnf(c_0_83,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_84,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
clause158 ).
cnf(c_0_85,negated_conjecture,
( memberP(X1,sk5)
| ~ rearsegP(X1,sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_31]),c_0_71])]) ).
cnf(c_0_86,negated_conjecture,
( rearsegP(app(sk4,sk7),sk3)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_71]),c_0_48])]) ).
cnf(c_0_87,negated_conjecture,
( ssList(app(sk4,sk7))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_82]),c_0_48]),c_0_71])]) ).
cnf(c_0_88,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_89,negated_conjecture,
( memberP(sk4,X1)
| ~ memberP(sk7,X1)
| ~ ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_60]),c_0_48])]) ).
cnf(c_0_90,plain,
( memberP(X1,X2)
| memberP(X3,X2)
| ~ memberP(app(X1,X3),X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_73])]) ).
cnf(c_0_91,negated_conjecture,
( memberP(app(sk4,sk7),sk5)
| ~ ssList(cons(sk6,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_92,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_88,c_0_34]) ).
cnf(c_0_93,negated_conjecture,
( memberP(sk4,X1)
| ~ memberP(sk7,X1)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_73])]) ).
cnf(c_0_94,negated_conjecture,
( memberP(sk7,sk5)
| ~ ssList(cons(sk6,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_48]),c_0_40])]),c_0_92]) ).
cnf(c_0_95,negated_conjecture,
~ ssList(cons(sk6,nil)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_92]) ).
cnf(c_0_96,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_73])]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC397-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.33 % Computer : n023.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue May 5 04:48:53 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.34 % start to proof: theBenchmark
% 2.05/1.92 % Version : CSE_E---1.7
% 2.05/1.92 % Problem : theBenchmark.p
% 2.05/1.92 % SZS status Unsatisfiable for theBenchmark.p
% 2.05/1.92 % SZS output start CNFRefutation
% See solution above
% 2.05/1.93 % Total time : 1.373s
%------------------------------------------------------------------------------