TSTP Solution File: SWC246-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC246-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:24:52 EDT 2024
% Result : Unsatisfiable 0.61s 0.63s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 28
% Syntax : Number of clauses : 99 ( 37 unt; 6 nHn; 80 RR)
% Number of literals : 259 ( 57 equ; 169 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 : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 152 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_15,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
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(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
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(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(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(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
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(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(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(c_0_28,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_29,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_30,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_28 ).
cnf(c_0_31,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
co1_15 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,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_35,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_30]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
app(app(sk6,sk1),sk7) = sk4,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk7),
co1_14 ).
cnf(c_0_38,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_34 ).
cnf(c_0_39,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_40,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_41,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_42,negated_conjecture,
( rearsegP(sk4,sk7)
| ~ ssList(app(sk6,sk1)) ),
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,
ssList(sk6),
co1_13 ).
cnf(c_0_44,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
sk2 = sk4,
co1_5 ).
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_38]) ).
cnf(c_0_48,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_39 ).
cnf(c_0_49,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_50,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_51,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_40 ).
cnf(c_0_52,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_41 ).
cnf(c_0_53,negated_conjecture,
rearsegP(sk4,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_43]),c_0_44])]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,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_47,c_0_48]) ).
cnf(c_0_56,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_49 ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_59,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_60,negated_conjecture,
( X1 = app(sk6,sk1)
| app(X1,sk7) != sk4
| ~ ssList(app(sk6,sk1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_36]),c_0_37])]) ).
cnf(c_0_61,negated_conjecture,
app(skaf46(sk4,sk7),sk7) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_37]),c_0_54])]) ).
cnf(c_0_62,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_63,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_55,c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_64,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_59 ).
cnf(c_0_65,negated_conjecture,
( skaf46(sk4,sk7) = app(sk6,sk1)
| ~ ssList(app(sk6,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_66,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_63,c_0_64]),c_0_57])]),c_0_58]) ).
cnf(c_0_67,negated_conjecture,
skaf46(sk4,sk7) = app(sk6,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_31]),c_0_43]),c_0_44])]) ).
cnf(c_0_68,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_58]),c_0_58]) ).
cnf(c_0_69,negated_conjecture,
ssList(app(sk6,sk1)),
inference(spm,[status(thm)],[c_0_62,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_71,negated_conjecture,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_73,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_74,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_70 ).
cnf(c_0_75,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_73 ).
cnf(c_0_77,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_78,negated_conjecture,
( memberP(X1,sk5(X2,X1,X3))
| app(app(X1,cons(X3,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_79,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_75])]) ).
cnf(c_0_80,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_77 ).
cnf(c_0_81,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_82,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_83,negated_conjecture,
( app(cons(X1,nil),X2) != sk1
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_56]),c_0_57])]),c_0_79]) ).
cnf(c_0_84,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_80,c_0_75])]) ).
cnf(c_0_85,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_81 ).
cnf(c_0_86,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_82 ).
cnf(c_0_87,negated_conjecture,
( cons(X1,app(nil,X2)) != sk1
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_57])]) ).
cnf(c_0_88,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_57])]) ).
cnf(c_0_89,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_90,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_91,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_92,negated_conjecture,
( cons(X1,X2) != sk1
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_93,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_90 ).
cnf(c_0_94,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_95,negated_conjecture,
nil != sk1,
c_0_91 ).
cnf(c_0_96,negated_conjecture,
~ ssList(cons(skaf83(sk1),nil)),
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_92,c_0_93]),c_0_94])])]),c_0_44])]),c_0_95]) ).
cnf(c_0_97,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_75])]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC246-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:50:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.61/0.63 # Version: 3.1.0
% 0.61/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.63 # Starting sh5l with 300s (1) cores
% 0.61/0.63 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3405 completed with status 0
% 0.61/0.63 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.61/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.63 # No SInE strategy applied
% 0.61/0.63 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.61/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.61/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.61/0.63 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.61/0.63 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.61/0.63 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.61/0.63 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3411 completed with status 0
% 0.61/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.61/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.63 # No SInE strategy applied
% 0.61/0.63 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.61/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.61/0.63 # Preprocessing time : 0.003 s
% 0.61/0.63 # Presaturation interreduction done
% 0.61/0.63
% 0.61/0.63 # Proof found!
% 0.61/0.63 # SZS status Unsatisfiable
% 0.61/0.63 # SZS output start CNFRefutation
% See solution above
% 0.61/0.63 # Parsed axioms : 204
% 0.61/0.63 # Removed by relevancy pruning/SinE : 0
% 0.61/0.63 # Initial clauses : 204
% 0.61/0.63 # Removed in clause preprocessing : 0
% 0.61/0.63 # Initial clauses in saturation : 204
% 0.61/0.63 # Processed clauses : 1090
% 0.61/0.63 # ...of these trivial : 9
% 0.61/0.63 # ...subsumed : 235
% 0.61/0.63 # ...remaining for further processing : 846
% 0.61/0.63 # Other redundant clauses eliminated : 210
% 0.61/0.63 # Clauses deleted for lack of memory : 0
% 0.61/0.63 # Backward-subsumed : 64
% 0.61/0.63 # Backward-rewritten : 161
% 0.61/0.63 # Generated clauses : 2453
% 0.61/0.63 # ...of the previous two non-redundant : 2163
% 0.61/0.63 # ...aggressively subsumed : 0
% 0.61/0.63 # Contextual simplify-reflections : 19
% 0.61/0.63 # Paramodulations : 2237
% 0.61/0.63 # Factorizations : 0
% 0.61/0.63 # NegExts : 0
% 0.61/0.63 # Equation resolutions : 217
% 0.61/0.63 # Disequality decompositions : 0
% 0.61/0.63 # Total rewrite steps : 2325
% 0.61/0.63 # ...of those cached : 2174
% 0.61/0.63 # Propositional unsat checks : 0
% 0.61/0.63 # Propositional check models : 0
% 0.61/0.63 # Propositional check unsatisfiable : 0
% 0.61/0.63 # Propositional clauses : 0
% 0.61/0.63 # Propositional clauses after purity: 0
% 0.61/0.63 # Propositional unsat core size : 0
% 0.61/0.63 # Propositional preprocessing time : 0.000
% 0.61/0.63 # Propositional encoding time : 0.000
% 0.61/0.63 # Propositional solver time : 0.000
% 0.61/0.63 # Success case prop preproc time : 0.000
% 0.61/0.63 # Success case prop encoding time : 0.000
% 0.61/0.63 # Success case prop solver time : 0.000
% 0.61/0.63 # Current number of processed clauses : 403
% 0.61/0.63 # Positive orientable unit clauses : 92
% 0.61/0.63 # Positive unorientable unit clauses: 0
% 0.61/0.63 # Negative unit clauses : 10
% 0.61/0.63 # Non-unit-clauses : 301
% 0.61/0.63 # Current number of unprocessed clauses: 1317
% 0.61/0.63 # ...number of literals in the above : 6798
% 0.61/0.63 # Current number of archived formulas : 0
% 0.61/0.63 # Current number of archived clauses : 420
% 0.61/0.63 # Clause-clause subsumption calls (NU) : 34347
% 0.61/0.63 # Rec. Clause-clause subsumption calls : 8263
% 0.61/0.63 # Non-unit clause-clause subsumptions : 242
% 0.61/0.63 # Unit Clause-clause subsumption calls : 1045
% 0.61/0.63 # Rewrite failures with RHS unbound : 0
% 0.61/0.63 # BW rewrite match attempts : 53
% 0.61/0.63 # BW rewrite match successes : 48
% 0.61/0.63 # Condensation attempts : 0
% 0.61/0.63 # Condensation successes : 0
% 0.61/0.63 # Termbank termtop insertions : 54293
% 0.61/0.63 # Search garbage collected termcells : 570
% 0.61/0.63
% 0.61/0.63 # -------------------------------------------------
% 0.61/0.63 # User time : 0.119 s
% 0.61/0.63 # System time : 0.007 s
% 0.61/0.63 # Total time : 0.126 s
% 0.61/0.63 # Maximum resident set size: 2140 pages
% 0.61/0.63
% 0.61/0.63 # -------------------------------------------------
% 0.61/0.63 # User time : 0.579 s
% 0.61/0.63 # System time : 0.041 s
% 0.61/0.63 # Total time : 0.620 s
% 0.61/0.63 # Maximum resident set size: 1880 pages
% 1.35/0.64 % E---3.1 exiting
% 1.35/0.64 % E exiting
%------------------------------------------------------------------------------