TSTP Solution File: SWC237-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC237-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:10 EDT 2023
% Result : Unsatisfiable 6.91s 1.34s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 91 ( 30 unt; 17 nHn; 81 RR)
% Number of literals : 230 ( 76 equ; 136 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 114 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
app(sk3,sk6) = sk4,
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_6) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause123) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_1) ).
cnf(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_13) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_7) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_5) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause118) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause75) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause85) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause149) ).
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/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause179) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause76) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause8) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause150) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause74) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause72) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause157) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause86) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause71) ).
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/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',co1_9) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause120) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause109) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p',clause13) ).
cnf(c_0_28,negated_conjecture,
app(sk3,sk6) = sk4,
co1_14 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_31,negated_conjecture,
app(sk1,sk6) = sk4,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_33,negated_conjecture,
ssList(sk6),
co1_13 ).
cnf(c_0_34,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_35,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_38,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_39,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_40,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_41,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_42,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_43,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_44,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_45,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_33]),c_0_32])]),c_0_34]) ).
cnf(c_0_48,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_37]) ).
cnf(c_0_49,negated_conjecture,
app(tl(sk1),sk6) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_50,negated_conjecture,
( app(sk1,app(sk6,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_51,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_52,axiom,
ssList(nil),
clause8 ).
cnf(c_0_53,plain,
( nil = X1
| app(app(X2,cons(hd(X1),X3)),X1) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X4) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_38]),c_0_44]) ).
cnf(c_0_54,negated_conjecture,
cons(hd(sk1),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_55,negated_conjecture,
ssList(tl(sk4)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_56,negated_conjecture,
( ssList(app(sk4,X1))
| ~ ssList(app(sk6,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_50]),c_0_32])]) ).
cnf(c_0_57,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_58,negated_conjecture,
app(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_31]),c_0_52]),c_0_33])]) ).
cnf(c_0_59,negated_conjecture,
( app(app(X1,sk4),sk1) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_32])]),c_0_34]) ).
cnf(c_0_60,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_61,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_62,negated_conjecture,
( ssList(app(sk4,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_40]),c_0_33])]) ).
cnf(c_0_63,negated_conjecture,
( nil = X1
| app(sk4,X1) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_52]),c_0_46])]) ).
cnf(c_0_64,negated_conjecture,
( app(sk4,app(nil,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_58]),c_0_46]),c_0_52])]) ).
cnf(c_0_65,negated_conjecture,
( app(sk4,sk1) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_52]),c_0_46])]) ).
cnf(c_0_66,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( app(nil,X1) = nil
| app(sk4,X1) != sk4
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(app(sk4,sk1))
| ~ duplicatefreeP(app(sk4,sk1)) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,sk1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_32]) ).
cnf(c_0_70,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_71,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_72,negated_conjecture,
( app(nil,nil) = nil
| ~ ssList(app(nil,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_51]),c_0_52]),c_0_46])]) ).
cnf(c_0_73,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
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 ),
co1_9 ).
cnf(c_0_75,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,sk1)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_76,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_70]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_40]),c_0_52])]) ).
cnf(c_0_78,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != sk1
| ~ ssItem(sk5(X2,nil,X1))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_52])]) ).
cnf(c_0_79,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_40]),c_0_46]),c_0_32])]) ).
cnf(c_0_80,negated_conjecture,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_52])]) ).
cnf(c_0_81,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != sk1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_79])]) ).
cnf(c_0_82,negated_conjecture,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_79])]) ).
cnf(c_0_83,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_84,negated_conjecture,
( app(cons(X1,nil),X2) != sk1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_60]),c_0_82])]) ).
cnf(c_0_85,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_79])]) ).
cnf(c_0_86,negated_conjecture,
( cons(X1,X2) != sk1
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_87,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_88,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_89,negated_conjecture,
( nil = X1
| X1 != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_32]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC237-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:39:05 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.pfgiOLr95I/E---3.1_12890.p
% 6.91/1.34 # Version: 3.1pre001
% 6.91/1.34 # Preprocessing class: FSLSSMSMSSSNFFN.
% 6.91/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.91/1.34 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.91/1.34 # Starting new_bool_3 with 300s (1) cores
% 6.91/1.34 # Starting new_bool_1 with 300s (1) cores
% 6.91/1.34 # Starting sh5l with 300s (1) cores
% 6.91/1.34 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12967 completed with status 0
% 6.91/1.34 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.91/1.34 # Preprocessing class: FSLSSMSMSSSNFFN.
% 6.91/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.91/1.34 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.91/1.34 # No SInE strategy applied
% 6.91/1.34 # Search class: FGHSM-FSLM31-MFFFFFNN
% 6.91/1.34 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.91/1.34 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 6.91/1.34 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.91/1.34 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 6.91/1.34 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.91/1.34 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 6.91/1.34 # G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 12975 completed with status 0
% 6.91/1.34 # Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 6.91/1.34 # Preprocessing class: FSLSSMSMSSSNFFN.
% 6.91/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.91/1.34 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.91/1.34 # No SInE strategy applied
% 6.91/1.34 # Search class: FGHSM-FSLM31-MFFFFFNN
% 6.91/1.34 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.91/1.34 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 6.91/1.34 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.91/1.34 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 6.91/1.34 # Preprocessing time : 0.003 s
% 6.91/1.34 # Presaturation interreduction done
% 6.91/1.34
% 6.91/1.34 # Proof found!
% 6.91/1.34 # SZS status Unsatisfiable
% 6.91/1.34 # SZS output start CNFRefutation
% See solution above
% 6.91/1.34 # Parsed axioms : 202
% 6.91/1.34 # Removed by relevancy pruning/SinE : 0
% 6.91/1.34 # Initial clauses : 202
% 6.91/1.34 # Removed in clause preprocessing : 0
% 6.91/1.34 # Initial clauses in saturation : 202
% 6.91/1.34 # Processed clauses : 5798
% 6.91/1.34 # ...of these trivial : 61
% 6.91/1.34 # ...subsumed : 3464
% 6.91/1.34 # ...remaining for further processing : 2273
% 6.91/1.34 # Other redundant clauses eliminated : 455
% 6.91/1.34 # Clauses deleted for lack of memory : 0
% 6.91/1.34 # Backward-subsumed : 729
% 6.91/1.34 # Backward-rewritten : 399
% 6.91/1.34 # Generated clauses : 28215
% 6.91/1.34 # ...of the previous two non-redundant : 26595
% 6.91/1.34 # ...aggressively subsumed : 0
% 6.91/1.34 # Contextual simplify-reflections : 221
% 6.91/1.34 # Paramodulations : 27642
% 6.91/1.34 # Factorizations : 0
% 6.91/1.34 # NegExts : 0
% 6.91/1.34 # Equation resolutions : 573
% 6.91/1.34 # Total rewrite steps : 21122
% 6.91/1.34 # Propositional unsat checks : 0
% 6.91/1.34 # Propositional check models : 0
% 6.91/1.34 # Propositional check unsatisfiable : 0
% 6.91/1.34 # Propositional clauses : 0
% 6.91/1.34 # Propositional clauses after purity: 0
% 6.91/1.34 # Propositional unsat core size : 0
% 6.91/1.34 # Propositional preprocessing time : 0.000
% 6.91/1.34 # Propositional encoding time : 0.000
% 6.91/1.34 # Propositional solver time : 0.000
% 6.91/1.34 # Success case prop preproc time : 0.000
% 6.91/1.34 # Success case prop encoding time : 0.000
% 6.91/1.34 # Success case prop solver time : 0.000
% 6.91/1.35 # Current number of processed clauses : 945
% 6.91/1.35 # Positive orientable unit clauses : 103
% 6.91/1.35 # Positive unorientable unit clauses: 0
% 6.91/1.35 # Negative unit clauses : 61
% 6.91/1.35 # Non-unit-clauses : 781
% 6.91/1.35 # Current number of unprocessed clauses: 20899
% 6.91/1.35 # ...number of literals in the above : 128409
% 6.91/1.35 # Current number of archived formulas : 0
% 6.91/1.35 # Current number of archived clauses : 1323
% 6.91/1.35 # Clause-clause subsumption calls (NU) : 553374
% 6.91/1.35 # Rec. Clause-clause subsumption calls : 147923
% 6.91/1.35 # Non-unit clause-clause subsumptions : 2529
% 6.91/1.35 # Unit Clause-clause subsumption calls : 11105
% 6.91/1.35 # Rewrite failures with RHS unbound : 0
% 6.91/1.35 # BW rewrite match attempts : 62
% 6.91/1.35 # BW rewrite match successes : 48
% 6.91/1.35 # Condensation attempts : 0
% 6.91/1.35 # Condensation successes : 0
% 6.91/1.35 # Termbank termtop insertions : 475270
% 6.91/1.35
% 6.91/1.35 # -------------------------------------------------
% 6.91/1.35 # User time : 0.846 s
% 6.91/1.35 # System time : 0.021 s
% 6.91/1.35 # Total time : 0.867 s
% 6.91/1.35 # Maximum resident set size: 2100 pages
% 6.91/1.35
% 6.91/1.35 # -------------------------------------------------
% 6.91/1.35 # User time : 4.188 s
% 6.91/1.35 # System time : 0.118 s
% 6.91/1.35 # Total time : 4.306 s
% 6.91/1.35 # Maximum resident set size: 1856 pages
% 6.91/1.35 % E---3.1 exiting
%------------------------------------------------------------------------------