TSTP Solution File: SWC327-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC327-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:25:42 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 85 ( 24 unt; 23 nHn; 85 RR)
% Number of literals : 267 ( 126 equ; 172 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_19,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_9,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_18,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_16,negated_conjecture,
( ssList(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( app(sk8(X1),cons(sk6(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_14,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_10,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X3)
| app(X3,cons(X1,nil)) != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_15,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(c_0_21,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_22,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_26,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_27,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_28,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_29,negated_conjecture,
equalelemsP(sk3),
co1_9 ).
cnf(c_0_30,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_21 ).
cnf(c_0_31,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_33,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_34,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_35,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_26 ).
cnf(c_0_36,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_37,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
c_0_28 ).
cnf(c_0_38,negated_conjecture,
equalelemsP(sk1),
inference(rw,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( sk5 = nil
| sk2 != nil ),
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])]) ).
cnf(c_0_40,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_41,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,negated_conjecture,
( app(sk1,nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
c_0_40 ).
cnf(c_0_46,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_47,negated_conjecture,
( sk2 != nil
| ~ ssItem(sk6(nil))
| ~ ssList(sk7(nil)) ),
inference(csr,[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_41,c_0_42]),c_0_43])])]),c_0_43])]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ssItem(sk6(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_38])]) ).
cnf(c_0_49,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1)
| nil != sk2 ),
c_0_46 ).
cnf(c_0_50,negated_conjecture,
( nil = sk4
| nil != sk3 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_52,negated_conjecture,
( ssList(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_53,negated_conjecture,
( app(sk8(X1),cons(sk6(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_54,negated_conjecture,
( sk2 != nil
| ~ ssList(sk7(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_43])]),c_0_44]) ).
cnf(c_0_55,negated_conjecture,
( ssList(sk7(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_38])]) ).
cnf(c_0_56,negated_conjecture,
( nil = sk4
| nil != sk3 ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
c_0_51 ).
cnf(c_0_58,negated_conjecture,
( ssList(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
c_0_52 ).
cnf(c_0_59,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X3)
| app(X3,cons(X1,nil)) != sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_61,negated_conjecture,
( app(sk8(X1),cons(sk6(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
c_0_53 ).
cnf(c_0_62,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_43])]),c_0_44]) ).
cnf(c_0_63,negated_conjecture,
( sk2 = nil
| sk1 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_24]),c_0_23]) ).
cnf(c_0_64,negated_conjecture,
( sk1 = nil
| ssItem(sk6(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_38])]) ).
cnf(c_0_65,negated_conjecture,
( sk1 = nil
| ssList(sk8(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_38])]) ).
cnf(c_0_66,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_67,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
c_0_59 ).
cnf(c_0_68,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X3)
| app(X3,cons(X1,nil)) != sk3 ),
c_0_60 ).
cnf(c_0_69,negated_conjecture,
( app(sk8(X1),cons(sk6(X1),nil)) = sk1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_38])]) ).
cnf(c_0_70,negated_conjecture,
sk1 != nil,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( sk1 = nil
| ssItem(sk6(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_31]),c_0_32])]) ).
cnf(c_0_72,negated_conjecture,
( sk1 = nil
| ssList(sk8(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_31]),c_0_32])]) ).
cnf(c_0_73,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ equalelemsP(sk1) ),
c_0_66 ).
cnf(c_0_74,negated_conjecture,
( sk1 = nil
| ssList(sk7(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_38])]) ).
cnf(c_0_75,negated_conjecture,
( app(X1,cons(X2,nil)) != sk1
| app(cons(X2,nil),X3) != sk5
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_68,c_0_23]) ).
cnf(c_0_76,negated_conjecture,
app(sk8(sk5),cons(sk6(sk5),nil)) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_31]),c_0_32])]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
ssItem(sk6(sk5)),
inference(sr,[status(thm)],[c_0_71,c_0_70]) ).
cnf(c_0_78,negated_conjecture,
ssList(sk8(sk5)),
inference(sr,[status(thm)],[c_0_72,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_38])]) ).
cnf(c_0_80,negated_conjecture,
( sk1 = nil
| ssList(sk7(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_31]),c_0_32])]) ).
cnf(c_0_81,negated_conjecture,
( app(cons(sk6(sk5),nil),X1) != sk5
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_78])]) ).
cnf(c_0_82,negated_conjecture,
app(cons(sk6(sk5),nil),sk7(sk5)) = sk5,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_31]),c_0_32])]),c_0_70]) ).
cnf(c_0_83,negated_conjecture,
ssList(sk7(sk5)),
inference(sr,[status(thm)],[c_0_80,c_0_70]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC327-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:12:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 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.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_1 with pid 6711 completed with status 0
% 0.22/0.52 # Result found by new_bool_1
% 0.22/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6715 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.003 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 206
% 0.22/0.52 # Removed by relevancy pruning/SinE : 165
% 0.22/0.52 # Initial clauses : 41
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 41
% 0.22/0.52 # Processed clauses : 232
% 0.22/0.52 # ...of these trivial : 11
% 0.22/0.52 # ...subsumed : 63
% 0.22/0.52 # ...remaining for further processing : 158
% 0.22/0.52 # Other redundant clauses eliminated : 12
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 38
% 0.22/0.52 # Backward-rewritten : 0
% 0.22/0.52 # Generated clauses : 374
% 0.22/0.52 # ...of the previous two non-redundant : 324
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 10
% 0.22/0.52 # Paramodulations : 352
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 14
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 287
% 0.22/0.52 # ...of those cached : 274
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 70
% 0.22/0.52 # Positive orientable unit clauses : 21
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 5
% 0.22/0.52 # Non-unit-clauses : 44
% 0.22/0.52 # Current number of unprocessed clauses: 130
% 0.22/0.52 # ...number of literals in the above : 681
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 86
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 1483
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 810
% 0.22/0.52 # Non-unit clause-clause subsumptions : 81
% 0.22/0.52 # Unit Clause-clause subsumption calls : 154
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 4
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 8830
% 0.22/0.52 # Search garbage collected termcells : 967
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.021 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.023 s
% 0.22/0.52 # Maximum resident set size: 2092 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.025 s
% 0.22/0.52 # System time : 0.004 s
% 0.22/0.52 # Total time : 0.029 s
% 0.22/0.52 # Maximum resident set size: 1884 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------