TSTP Solution File: SWC077-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC077-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 04:27:27 EDT 2024
% Result : Unsatisfiable 2.59s 0.80s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 46
% Syntax : Number of clauses : 184 ( 48 unt; 26 nHn; 156 RR)
% Number of literals : 542 ( 127 equ; 354 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 295 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
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(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_11,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
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(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
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(clause59,axiom,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause59) ).
cnf(co1_10,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_46,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_47,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_46 ).
cnf(c_0_48,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_49,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_47]) ).
cnf(c_0_50,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_48 ).
cnf(c_0_51,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_52,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_53,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_54,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_55,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_57,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_58,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_59,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_60,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_61,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_51 ).
cnf(c_0_62,axiom,
ssList(nil),
clause8 ).
cnf(c_0_63,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_52 ).
cnf(c_0_64,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_65,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_53 ).
cnf(c_0_66,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_67,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_68,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_69,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_70,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_71,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(cons(X2,X3),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]),c_0_63]) ).
cnf(c_0_72,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_64 ).
cnf(c_0_73,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_74,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_62])]) ).
cnf(c_0_75,negated_conjecture,
app(sk3,skaf45(sk4,sk3)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70])]) ).
cnf(c_0_76,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_77,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X2,cons(X2,X3)))
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_62])]),c_0_63]) ).
cnf(c_0_78,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_79,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_80,negated_conjecture,
rearsegP(sk4,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_69]),c_0_76])]) ).
cnf(c_0_81,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_82,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_63]),c_0_63]) ).
cnf(c_0_83,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_84,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_85,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_86,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_87,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_88,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_78 ).
cnf(c_0_89,negated_conjecture,
app(skaf46(sk4,nil),nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_62]),c_0_70])]) ).
cnf(c_0_90,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_91,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_81 ).
cnf(c_0_92,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_93,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_94,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_95,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_84 ).
cnf(c_0_96,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_85 ).
cnf(c_0_97,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_86 ).
cnf(c_0_98,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_87 ).
cnf(c_0_99,negated_conjecture,
skaf46(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_100,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_57]),c_0_59]) ).
cnf(c_0_101,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_92 ).
cnf(c_0_102,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_103,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_98]) ).
cnf(c_0_104,negated_conjecture,
app(sk4,nil) = sk4,
inference(rw,[status(thm)],[c_0_89,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_75]),c_0_76]),c_0_69])]),c_0_100]) ).
cnf(c_0_106,plain,
( X1 = X2
| cons(X3,X1) != cons(X4,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102]),c_0_102])]) ).
cnf(c_0_107,negated_conjecture,
cons(hd(sk4),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_70]),c_0_62])]),c_0_105]) ).
cnf(c_0_108,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_109,negated_conjecture,
( tl(sk4) = X1
| cons(X2,X1) != sk4
| ~ ssList(tl(sk4))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_108 ).
cnf(c_0_111,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_112,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_113,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_114,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_115,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_116,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_117,negated_conjecture,
( skaf82(sk4) = tl(sk4)
| ~ ssList(tl(sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111])])]),c_0_70])]),c_0_105]) ).
cnf(c_0_118,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_112 ).
cnf(c_0_119,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_113 ).
cnf(c_0_120,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_121,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_114 ).
cnf(c_0_122,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_123,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_124,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_115 ).
cnf(c_0_125,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_116 ).
cnf(c_0_126,negated_conjecture,
skaf82(sk4) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_70])]),c_0_105]) ).
cnf(c_0_127,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_128,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_57]),c_0_59]) ).
cnf(c_0_129,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_120 ).
cnf(c_0_130,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_131,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_121]) ).
cnf(c_0_132,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_122 ).
cnf(c_0_133,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_123 ).
cnf(c_0_134,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_61]),c_0_62])]) ).
cnf(c_0_135,negated_conjecture,
app(tl(sk4),nil) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_104]),c_0_70]),c_0_62])]),c_0_105]) ).
cnf(c_0_136,negated_conjecture,
ssList(tl(sk4)),
inference(spm,[status(thm)],[c_0_111,c_0_126]) ).
cnf(c_0_137,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_127 ).
cnf(c_0_138,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_139,negated_conjecture,
( nil = X1
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_62])]) ).
cnf(c_0_140,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_130 ).
cnf(c_0_141,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_61]),c_0_62])]),c_0_97]) ).
cnf(c_0_142,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_132]) ).
cnf(c_0_143,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_133]),c_0_97]) ).
cnf(c_0_144,negated_conjecture,
app(nil,tl(sk4)) = tl(sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_62])]) ).
cnf(c_0_145,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_124]),c_0_97]) ).
cnf(c_0_146,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_137])]),c_0_62])]) ).
cnf(c_0_147,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_138 ).
cnf(c_0_148,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_149,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_150,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_69])]) ).
cnf(c_0_151,negated_conjecture,
segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_75]),c_0_76]),c_0_69])]) ).
cnf(c_0_152,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_153,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_102])]) ).
cnf(c_0_154,negated_conjecture,
frontsegP(tl(sk4),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_136]),c_0_62])]) ).
cnf(c_0_155,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_62])]) ).
cnf(c_0_156,plain,
( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_102])]) ).
cnf(c_0_157,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_102])]) ).
cnf(c_0_158,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
c_0_148 ).
cnf(c_0_159,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_160,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_161,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
c_0_149 ).
cnf(c_0_162,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_151])]) ).
cnf(c_0_163,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_152 ).
cnf(c_0_164,negated_conjecture,
frontsegP(cons(X1,tl(sk4)),cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_62]),c_0_136])]) ).
cnf(c_0_165,plain,
( ssList(cons(X1,app(X2,nil)))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_62])]),c_0_157]) ).
cnf(c_0_166,plain,
( app(skaf46(X1,X1),X1) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_158]) ).
cnf(c_0_167,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_159 ).
cnf(c_0_168,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_169,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_160 ).
cnf(c_0_170,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_162]),c_0_162]),c_0_163]) ).
cnf(c_0_171,negated_conjecture,
frontsegP(sk4,cons(hd(sk4),nil)),
inference(spm,[status(thm)],[c_0_164,c_0_107]) ).
cnf(c_0_172,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_90]),c_0_62])]) ).
cnf(c_0_173,plain,
strictorderedP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_102])]) ).
cnf(c_0_174,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_168 ).
cnf(c_0_175,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_176,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_169]) ).
cnf(c_0_177,negated_conjecture,
~ neq(nil,cons(hd(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_173])]) ).
cnf(c_0_178,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_102]),c_0_102])]) ).
cnf(c_0_179,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_175 ).
cnf(c_0_180,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_102])]) ).
cnf(c_0_181,negated_conjecture,
cons(hd(sk4),nil) = nil,
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_182,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_102])]) ).
cnf(c_0_183,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_181]),c_0_62])]),c_0_182]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC077-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 : Sun May 19 02:38:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/0.80 # Version: 3.1.0
% 2.59/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.59/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.59/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.59/0.80 # Starting sh5l with 300s (1) cores
% 2.59/0.80 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 12614 completed with status 0
% 2.59/0.80 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.59/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.59/0.80 # No SInE strategy applied
% 2.59/0.80 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.59/0.80 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.59/0.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.59/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.59/0.80 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.59/0.80 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.59/0.80 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.59/0.80 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 12620 completed with status 0
% 2.59/0.80 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.59/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.59/0.80 # No SInE strategy applied
% 2.59/0.80 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.59/0.80 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.59/0.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.59/0.80 # Preprocessing time : 0.003 s
% 2.59/0.80 # Presaturation interreduction done
% 2.59/0.80
% 2.59/0.80 # Proof found!
% 2.59/0.80 # SZS status Unsatisfiable
% 2.59/0.80 # SZS output start CNFRefutation
% See solution above
% 2.59/0.80 # Parsed axioms : 196
% 2.59/0.80 # Removed by relevancy pruning/SinE : 0
% 2.59/0.80 # Initial clauses : 196
% 2.59/0.80 # Removed in clause preprocessing : 0
% 2.59/0.80 # Initial clauses in saturation : 196
% 2.59/0.80 # Processed clauses : 3668
% 2.59/0.80 # ...of these trivial : 74
% 2.59/0.80 # ...subsumed : 2097
% 2.59/0.80 # ...remaining for further processing : 1497
% 2.59/0.80 # Other redundant clauses eliminated : 199
% 2.59/0.80 # Clauses deleted for lack of memory : 0
% 2.59/0.80 # Backward-subsumed : 67
% 2.59/0.80 # Backward-rewritten : 371
% 2.59/0.80 # Generated clauses : 12198
% 2.59/0.80 # ...of the previous two non-redundant : 10434
% 2.59/0.80 # ...aggressively subsumed : 0
% 2.59/0.80 # Contextual simplify-reflections : 142
% 2.59/0.80 # Paramodulations : 11987
% 2.59/0.80 # Factorizations : 0
% 2.59/0.80 # NegExts : 0
% 2.59/0.80 # Equation resolutions : 212
% 2.59/0.80 # Disequality decompositions : 0
% 2.59/0.80 # Total rewrite steps : 14582
% 2.59/0.80 # ...of those cached : 14119
% 2.59/0.80 # Propositional unsat checks : 0
% 2.59/0.80 # Propositional check models : 0
% 2.59/0.80 # Propositional check unsatisfiable : 0
% 2.59/0.80 # Propositional clauses : 0
% 2.59/0.80 # Propositional clauses after purity: 0
% 2.59/0.80 # Propositional unsat core size : 0
% 2.59/0.80 # Propositional preprocessing time : 0.000
% 2.59/0.80 # Propositional encoding time : 0.000
% 2.59/0.80 # Propositional solver time : 0.000
% 2.59/0.80 # Success case prop preproc time : 0.000
% 2.59/0.80 # Success case prop encoding time : 0.000
% 2.59/0.80 # Success case prop solver time : 0.000
% 2.59/0.80 # Current number of processed clauses : 848
% 2.59/0.80 # Positive orientable unit clauses : 185
% 2.59/0.80 # Positive unorientable unit clauses: 0
% 2.59/0.80 # Negative unit clauses : 58
% 2.59/0.80 # Non-unit-clauses : 605
% 2.59/0.80 # Current number of unprocessed clauses: 6263
% 2.59/0.80 # ...number of literals in the above : 32168
% 2.59/0.80 # Current number of archived formulas : 0
% 2.59/0.80 # Current number of archived clauses : 626
% 2.59/0.80 # Clause-clause subsumption calls (NU) : 139102
% 2.59/0.80 # Rec. Clause-clause subsumption calls : 38492
% 2.59/0.80 # Non-unit clause-clause subsumptions : 1689
% 2.59/0.80 # Unit Clause-clause subsumption calls : 5465
% 2.59/0.80 # Rewrite failures with RHS unbound : 0
% 2.59/0.80 # BW rewrite match attempts : 106
% 2.59/0.80 # BW rewrite match successes : 82
% 2.59/0.80 # Condensation attempts : 0
% 2.59/0.80 # Condensation successes : 0
% 2.59/0.80 # Termbank termtop insertions : 237226
% 2.59/0.80 # Search garbage collected termcells : 552
% 2.59/0.80
% 2.59/0.80 # -------------------------------------------------
% 2.59/0.80 # User time : 0.295 s
% 2.59/0.80 # System time : 0.010 s
% 2.59/0.80 # Total time : 0.305 s
% 2.59/0.80 # Maximum resident set size: 2144 pages
% 2.59/0.80
% 2.59/0.80 # -------------------------------------------------
% 2.59/0.80 # User time : 1.456 s
% 2.59/0.80 # System time : 0.067 s
% 2.59/0.80 # Total time : 1.524 s
% 2.59/0.80 # Maximum resident set size: 1872 pages
% 2.59/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------