TSTP Solution File: SWC171-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC171-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n025.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 : Thu Aug 31 20:20:24 EDT 2023
% Result : Unsatisfiable 0.68s 0.79s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 99
% Syntax : Number of formulae : 153 ( 36 unt; 77 typ; 0 def)
% Number of atoms : 160 ( 40 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 167 ( 83 ~; 84 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 65 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 58 ( 58 usr; 12 con; 0-2 aty)
% Number of variables : 70 ( 13 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nil: $i ).
tff(decl_23,type,
equalelemsP: $i > $o ).
tff(decl_24,type,
duplicatefreeP: $i > $o ).
tff(decl_25,type,
strictorderedP: $i > $o ).
tff(decl_26,type,
totalorderedP: $i > $o ).
tff(decl_27,type,
strictorderP: $i > $o ).
tff(decl_28,type,
totalorderP: $i > $o ).
tff(decl_29,type,
cyclefreeP: $i > $o ).
tff(decl_30,type,
ssList: $i > $o ).
tff(decl_31,type,
skac3: $i ).
tff(decl_32,type,
ssItem: $i > $o ).
tff(decl_33,type,
skac2: $i ).
tff(decl_34,type,
singletonP: $i > $o ).
tff(decl_35,type,
skaf83: $i > $i ).
tff(decl_36,type,
skaf82: $i > $i ).
tff(decl_37,type,
skaf81: $i > $i ).
tff(decl_38,type,
skaf80: $i > $i ).
tff(decl_39,type,
skaf79: $i > $i ).
tff(decl_40,type,
skaf78: $i > $i ).
tff(decl_41,type,
skaf77: $i > $i ).
tff(decl_42,type,
skaf76: $i > $i ).
tff(decl_43,type,
skaf75: $i > $i ).
tff(decl_44,type,
skaf74: $i > $i ).
tff(decl_45,type,
skaf73: $i > $i ).
tff(decl_46,type,
skaf72: $i > $i ).
tff(decl_47,type,
skaf71: $i > $i ).
tff(decl_48,type,
skaf70: $i > $i ).
tff(decl_49,type,
skaf69: $i > $i ).
tff(decl_50,type,
skaf68: $i > $i ).
tff(decl_51,type,
skaf67: $i > $i ).
tff(decl_52,type,
skaf66: $i > $i ).
tff(decl_53,type,
skaf65: $i > $i ).
tff(decl_54,type,
skaf64: $i > $i ).
tff(decl_55,type,
skaf63: $i > $i ).
tff(decl_56,type,
skaf62: $i > $i ).
tff(decl_57,type,
skaf61: $i > $i ).
tff(decl_58,type,
skaf60: $i > $i ).
tff(decl_59,type,
skaf59: $i > $i ).
tff(decl_60,type,
skaf58: $i > $i ).
tff(decl_61,type,
skaf57: $i > $i ).
tff(decl_62,type,
skaf56: $i > $i ).
tff(decl_63,type,
skaf55: $i > $i ).
tff(decl_64,type,
skaf54: $i > $i ).
tff(decl_65,type,
skaf53: $i > $i ).
tff(decl_66,type,
skaf52: $i > $i ).
tff(decl_67,type,
skaf51: $i > $i ).
tff(decl_68,type,
skaf50: $i > $i ).
tff(decl_69,type,
skaf49: $i > $i ).
tff(decl_70,type,
skaf44: $i > $i ).
tff(decl_71,type,
skaf48: ( $i * $i ) > $i ).
tff(decl_72,type,
skaf47: ( $i * $i ) > $i ).
tff(decl_73,type,
skaf46: ( $i * $i ) > $i ).
tff(decl_74,type,
skaf45: ( $i * $i ) > $i ).
tff(decl_75,type,
skaf43: ( $i * $i ) > $i ).
tff(decl_76,type,
skaf42: ( $i * $i ) > $i ).
tff(decl_77,type,
geq: ( $i * $i ) > $o ).
tff(decl_78,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_79,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_80,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_81,type,
leq: ( $i * $i ) > $o ).
tff(decl_82,type,
lt: ( $i * $i ) > $o ).
tff(decl_83,type,
cons: ( $i * $i ) > $i ).
tff(decl_84,type,
memberP: ( $i * $i ) > $o ).
tff(decl_85,type,
app: ( $i * $i ) > $i ).
tff(decl_86,type,
tl: $i > $i ).
tff(decl_87,type,
hd: $i > $i ).
tff(decl_88,type,
neq: ( $i * $i ) > $o ).
tff(decl_89,type,
gt: ( $i * $i ) > $o ).
tff(decl_90,type,
sk1: $i ).
tff(decl_91,type,
sk2: $i ).
tff(decl_92,type,
sk3: $i ).
tff(decl_93,type,
sk4: $i ).
tff(decl_94,type,
sk5: $i ).
tff(decl_95,type,
sk6: $i ).
tff(decl_96,type,
sk7: $i ).
tff(decl_97,type,
sk8: $i ).
tff(decl_98,type,
sk9: $i ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause65,axiom,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause2,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause2) ).
cnf(c_0_22,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
~ neq(sk5,sk6),
co1_12 ).
cnf(c_0_25,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_28,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_30,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_32,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_30])]) ).
cnf(c_0_33,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]),c_0_34])]) ).
cnf(c_0_36,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_37,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).
cnf(c_0_38,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_26]),c_0_34])]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_40,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_38]),c_0_31]),c_0_39])]) ).
cnf(c_0_41,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_26]),c_0_34])]) ).
cnf(c_0_43,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_44,negated_conjecture,
( app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_26]),c_0_39])]) ).
cnf(c_0_45,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_46,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_26]),c_0_34])]) ).
cnf(c_0_47,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_45]) ).
cnf(c_0_48,negated_conjecture,
app(sk7,cons(sk5,cons(sk5,sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_26]),c_0_39])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(cons(sk5,sk8))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_26]),c_0_31])]) ).
cnf(c_0_50,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_51,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(cons(sk5,sk8))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_53,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_33]),c_0_26]),c_0_39])]) ).
cnf(c_0_54,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_55,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_52,c_0_23]) ).
cnf(c_0_56,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_33]),c_0_26])]) ).
cnf(c_0_58,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_59,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_30]),c_0_39])]) ).
cnf(c_0_61,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_34])]) ).
cnf(c_0_63,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_54]),c_0_31])]) ).
cnf(c_0_64,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_61]),c_0_34])]) ).
cnf(c_0_65,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_59])]) ).
cnf(c_0_66,axiom,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
clause65 ).
cnf(c_0_67,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_68,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_69,plain,
( ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_59])]) ).
cnf(c_0_70,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_39])]) ).
cnf(c_0_71,negated_conjecture,
( sk3 = nil
| duplicatefreeP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
~ duplicatefreeP(sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_55]),c_0_39]),c_0_34]),c_0_31])]) ).
cnf(c_0_73,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,axiom,
duplicatefreeP(nil),
clause2 ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC171-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n025.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 : Mon Aug 28 15:14:54 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.58 start to proof: theBenchmark
% 0.68/0.79 % Version : CSE_E---1.5
% 0.68/0.79 % Problem : theBenchmark.p
% 0.68/0.79 % Proof found
% 0.68/0.79 % SZS status Theorem for theBenchmark.p
% 0.68/0.79 % SZS output start Proof
% See solution above
% 0.68/0.80 % Total time : 0.203000 s
% 0.68/0.80 % SZS output end Proof
% 0.68/0.80 % Total time : 0.208000 s
%------------------------------------------------------------------------------