TSTP Solution File: SWC394-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC394-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:40:48 EDT 2023
% Result : Unsatisfiable 2.27s 0.76s
% Output : CNFRefutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 31
% Syntax : Number of clauses : 92 ( 43 unt; 5 nHn; 73 RR)
% Number of literals : 215 ( 30 equ; 128 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 127 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_1) ).
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/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause169) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_7) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause85) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause86) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause144) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause8) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause51) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause131) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause50) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause149) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause140) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause141) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_5) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause168) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_13) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',co1_9) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause49) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mwSSWwukPy/E---3.1_19561.p',clause71) ).
cnf(c_0_31,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_32,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_33,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_34,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_35,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_36,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_38,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,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_34]) ).
cnf(c_0_40,negated_conjecture,
app(skaf42(sk3,sk5),cons(sk5,skaf43(sk5,sk3))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_41,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_42,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]),c_0_41]),c_0_42])]) ).
cnf(c_0_44,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_45,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_47,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38])]) ).
cnf(c_0_48,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_49,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_50,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_37])]) ).
cnf(c_0_51,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_50,c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( frontsegP(sk3,skaf42(sk3,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_40]),c_0_42])]) ).
cnf(c_0_54,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_52])]) ).
cnf(c_0_55,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause136 ).
cnf(c_0_56,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_59,negated_conjecture,
frontsegP(sk3,skaf42(sk3,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_41])]) ).
cnf(c_0_60,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_61,negated_conjecture,
app(skaf42(sk3,sk5),skaf45(sk3,skaf42(sk3,sk5))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_42]),c_0_38])]) ).
cnf(c_0_62,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_63,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_64,negated_conjecture,
rearsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_42]),c_0_62])]) ).
cnf(c_0_65,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_66,negated_conjecture,
app(skaf46(sk3,nil),nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_57]),c_0_38])]) ).
cnf(c_0_67,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_68,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_69,negated_conjecture,
skaf46(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_70,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_71,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_72,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_68]),c_0_46]) ).
cnf(c_0_73,negated_conjecture,
app(sk3,nil) = sk3,
inference(rw,[status(thm)],[c_0_66,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_75,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_76,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_52])]) ).
cnf(c_0_77,negated_conjecture,
( memberP(app(X1,sk3),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_78,negated_conjecture,
( ssList(app(X1,sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_57]),c_0_38])]) ).
cnf(c_0_79,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_80,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
co1_13 ).
cnf(c_0_81,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_83,negated_conjecture,
( memberP(app(app(X1,sk3),X2),sk5)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_38]),c_0_81])]) ).
cnf(c_0_85,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_86,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_87,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_82,c_0_75]) ).
cnf(c_0_88,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_89,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86])]),c_0_87]) ).
cnf(c_0_90,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_52])]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_89]),c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC394-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n008.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 01:56:43 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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/tmp/tmp.mwSSWwukPy/E---3.1_19561.p
% 2.27/0.76 # Version: 3.1pre001
% 2.27/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.27/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.27/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.27/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.27/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.27/0.76 # Starting sh5l with 300s (1) cores
% 2.27/0.76 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19708 completed with status 0
% 2.27/0.76 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.27/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.27/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.27/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.27/0.76 # No SInE strategy applied
% 2.27/0.76 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.27/0.76 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.27/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.27/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.27/0.76 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.27/0.76 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.27/0.76 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.27/0.76 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 19714 completed with status 0
% 2.27/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.27/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.27/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.27/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.27/0.76 # No SInE strategy applied
% 2.27/0.76 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.27/0.76 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.27/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.27/0.76 # Preprocessing time : 0.002 s
% 2.27/0.76 # Presaturation interreduction done
% 2.27/0.76
% 2.27/0.76 # Proof found!
% 2.27/0.76 # SZS status Unsatisfiable
% 2.27/0.76 # SZS output start CNFRefutation
% See solution above
% 2.27/0.76 # Parsed axioms : 198
% 2.27/0.76 # Removed by relevancy pruning/SinE : 0
% 2.27/0.76 # Initial clauses : 198
% 2.27/0.76 # Removed in clause preprocessing : 0
% 2.27/0.76 # Initial clauses in saturation : 198
% 2.27/0.76 # Processed clauses : 3131
% 2.27/0.76 # ...of these trivial : 21
% 2.27/0.76 # ...subsumed : 1898
% 2.27/0.76 # ...remaining for further processing : 1212
% 2.27/0.76 # Other redundant clauses eliminated : 266
% 2.27/0.76 # Clauses deleted for lack of memory : 0
% 2.27/0.76 # Backward-subsumed : 51
% 2.27/0.76 # Backward-rewritten : 346
% 2.27/0.76 # Generated clauses : 9248
% 2.27/0.76 # ...of the previous two non-redundant : 8165
% 2.27/0.76 # ...aggressively subsumed : 0
% 2.27/0.76 # Contextual simplify-reflections : 120
% 2.27/0.76 # Paramodulations : 8974
% 2.27/0.76 # Factorizations : 0
% 2.27/0.76 # NegExts : 0
% 2.27/0.76 # Equation resolutions : 275
% 2.27/0.76 # Total rewrite steps : 10326
% 2.27/0.76 # Propositional unsat checks : 0
% 2.27/0.76 # Propositional check models : 0
% 2.27/0.76 # Propositional check unsatisfiable : 0
% 2.27/0.76 # Propositional clauses : 0
% 2.27/0.76 # Propositional clauses after purity: 0
% 2.27/0.76 # Propositional unsat core size : 0
% 2.27/0.76 # Propositional preprocessing time : 0.000
% 2.27/0.76 # Propositional encoding time : 0.000
% 2.27/0.76 # Propositional solver time : 0.000
% 2.27/0.76 # Success case prop preproc time : 0.000
% 2.27/0.76 # Success case prop encoding time : 0.000
% 2.27/0.76 # Success case prop solver time : 0.000
% 2.27/0.76 # Current number of processed clauses : 602
% 2.27/0.76 # Positive orientable unit clauses : 86
% 2.27/0.76 # Positive unorientable unit clauses: 0
% 2.27/0.76 # Negative unit clauses : 7
% 2.27/0.76 # Non-unit-clauses : 509
% 2.27/0.76 # Current number of unprocessed clauses: 4884
% 2.27/0.76 # ...number of literals in the above : 22443
% 2.27/0.76 # Current number of archived formulas : 0
% 2.27/0.76 # Current number of archived clauses : 587
% 2.27/0.76 # Clause-clause subsumption calls (NU) : 98953
% 2.27/0.76 # Rec. Clause-clause subsumption calls : 26896
% 2.27/0.76 # Non-unit clause-clause subsumptions : 1641
% 2.27/0.76 # Unit Clause-clause subsumption calls : 453
% 2.27/0.76 # Rewrite failures with RHS unbound : 0
% 2.27/0.76 # BW rewrite match attempts : 68
% 2.27/0.76 # BW rewrite match successes : 42
% 2.27/0.76 # Condensation attempts : 0
% 2.27/0.76 # Condensation successes : 0
% 2.27/0.76 # Termbank termtop insertions : 162416
% 2.27/0.76
% 2.27/0.76 # -------------------------------------------------
% 2.27/0.76 # User time : 0.233 s
% 2.27/0.76 # System time : 0.010 s
% 2.27/0.76 # Total time : 0.242 s
% 2.27/0.76 # Maximum resident set size: 2104 pages
% 2.27/0.76
% 2.27/0.76 # -------------------------------------------------
% 2.27/0.76 # User time : 1.144 s
% 2.27/0.76 # System time : 0.062 s
% 2.27/0.76 # Total time : 1.205 s
% 2.27/0.76 # Maximum resident set size: 1852 pages
% 2.27/0.76 % E---3.1 exiting
% 2.27/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------