TSTP Solution File: SWV252-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV252-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 05:21:56 EDT 2024
% Result : Unsatisfiable 1.46s 0.66s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of clauses : 72 ( 36 unt; 0 nHn; 44 RR)
% Number of literals : 117 ( 16 equ; 49 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 161 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oanalz__subset__iff_0,axiom,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__iff_0) ).
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(cls_Set_OUn__subset__iff_0,axiom,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_0) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_set_2) ).
cnf(cls_Set_Oinsert__subset_2,axiom,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_2) ).
cnf(cls_Set_OUn__subset__iff_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_1) ).
cnf(cls_Message_Oparts__synth_0,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__synth_0) ).
cnf(cls_Message_Oparts__analz_0,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__analz_0) ).
cnf(cls_Message_Oparts__subset__iff_0,axiom,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).
cnf(cls_Set_Oinsert__subset_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_1) ).
cnf(cls_Set_OUn__subset__iff_2,axiom,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_2) ).
cnf(cls_Message_Oanalz__parts_0,axiom,
c_Message_Oanalz(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__parts_0) ).
cnf(cls_Set_Oinsert__subset_0,axiom,
( c_in(X1,X4,X3)
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OUn__Diff__cancel2_0,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel2_0) ).
cnf(cls_Set_OUn__Diff__cancel_0,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__subset__iff_1,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).
cnf(c_0_19,plain,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__subset__iff_0]) ).
cnf(c_0_20,plain,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).
cnf(c_0_21,plain,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_0]) ).
cnf(c_0_22,plain,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
c_0_19 ).
cnf(c_0_23,plain,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
c_0_20 ).
cnf(c_0_24,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_25,plain,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_2]) ).
cnf(c_0_26,plain,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_1]) ).
cnf(c_0_27,plain,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
c_0_21 ).
cnf(c_0_28,plain,
c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oparts__synth_0 ).
cnf(c_0_30,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
cls_Message_Oparts__analz_0 ).
cnf(c_0_31,plain,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_0]) ).
cnf(c_0_32,plain,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
c_0_25 ).
cnf(c_0_33,plain,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_1]) ).
cnf(c_0_34,plain,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_2]) ).
cnf(c_0_35,plain,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
c_0_26 ).
cnf(c_0_36,plain,
c_lessequals(X1,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))) = c_union(c_Message_Oparts(X1),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,axiom,
c_Message_Oanalz(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
cls_Message_Oanalz__parts_0 ).
cnf(c_0_39,plain,
( c_in(X1,X4,X3)
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_0]) ).
cnf(c_0_40,plain,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_31 ).
cnf(c_0_41,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_42,plain,
( c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_24])]) ).
cnf(c_0_43,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_44,plain,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
c_0_33 ).
cnf(c_0_45,plain,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
c_0_34 ).
cnf(c_0_46,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_23]),c_0_24])]) ).
cnf(c_0_47,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_24])]) ).
cnf(c_0_48,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel2_0 ).
cnf(c_0_49,plain,
c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_50,plain,
( c_in(X1,X4,X3)
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
c_0_39 ).
cnf(c_0_51,plain,
c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_23]),c_0_24])]) ).
cnf(c_0_52,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_41 ).
cnf(c_0_53,negated_conjecture,
c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_24])]) ).
cnf(c_0_55,plain,
( c_lessequals(c_union(X1,X2,X3),c_union(X4,X1,X3),tc_set(X3))
| ~ c_lessequals(X2,c_union(X4,X1,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_56,plain,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel_0 ).
cnf(c_0_58,plain,
c_lessequals(X1,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_59,plain,
c_in(X1,c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_H)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_61,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_62,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_63,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_1]) ).
cnf(c_0_64,plain,
( c_lessequals(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X2))),tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X2))),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_32,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
c_0_61 ).
cnf(c_0_67,plain,
c_union(X1,X2,X3) = c_union(X2,X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_62]),c_0_62])]) ).
cnf(c_0_68,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_63 ).
cnf(c_0_69,negated_conjecture,
c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_37]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV252-2 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 07:08:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.46/0.66 # Version: 3.1.0
% 1.46/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.46/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.46/0.66 # Starting sh5l with 300s (1) cores
% 1.46/0.66 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12451 completed with status 0
% 1.46/0.66 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.46/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.66 # No SInE strategy applied
% 1.46/0.66 # Search class: FHUSM-FFMF31-MFFFFFNN
% 1.46/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.66 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 1.46/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.46/0.66 # Starting new_bool_3 with 136s (1) cores
% 1.46/0.66 # Starting new_bool_1 with 136s (1) cores
% 1.46/0.66 # Starting sh5l with 136s (1) cores
% 1.46/0.66 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 12455 completed with status 0
% 1.46/0.66 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 1.46/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.66 # No SInE strategy applied
% 1.46/0.66 # Search class: FHUSM-FFMF31-MFFFFFNN
% 1.46/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.66 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 1.46/0.66 # Preprocessing time : 0.001 s
% 1.46/0.66
% 1.46/0.66 # Proof found!
% 1.46/0.66 # SZS status Unsatisfiable
% 1.46/0.66 # SZS output start CNFRefutation
% See solution above
% 1.46/0.66 # Parsed axioms : 19
% 1.46/0.66 # Removed by relevancy pruning/SinE : 0
% 1.46/0.66 # Initial clauses : 19
% 1.46/0.66 # Removed in clause preprocessing : 0
% 1.46/0.66 # Initial clauses in saturation : 19
% 1.46/0.66 # Processed clauses : 1457
% 1.46/0.66 # ...of these trivial : 264
% 1.46/0.66 # ...subsumed : 468
% 1.46/0.66 # ...remaining for further processing : 725
% 1.46/0.66 # Other redundant clauses eliminated : 0
% 1.46/0.66 # Clauses deleted for lack of memory : 0
% 1.46/0.66 # Backward-subsumed : 6
% 1.46/0.66 # Backward-rewritten : 30
% 1.46/0.66 # Generated clauses : 21671
% 1.46/0.66 # ...of the previous two non-redundant : 14624
% 1.46/0.66 # ...aggressively subsumed : 0
% 1.46/0.66 # Contextual simplify-reflections : 0
% 1.46/0.66 # Paramodulations : 21671
% 1.46/0.66 # Factorizations : 0
% 1.46/0.66 # NegExts : 0
% 1.46/0.66 # Equation resolutions : 0
% 1.46/0.66 # Disequality decompositions : 0
% 1.46/0.66 # Total rewrite steps : 16442
% 1.46/0.66 # ...of those cached : 14639
% 1.46/0.66 # Propositional unsat checks : 0
% 1.46/0.66 # Propositional check models : 0
% 1.46/0.66 # Propositional check unsatisfiable : 0
% 1.46/0.66 # Propositional clauses : 0
% 1.46/0.66 # Propositional clauses after purity: 0
% 1.46/0.66 # Propositional unsat core size : 0
% 1.46/0.66 # Propositional preprocessing time : 0.000
% 1.46/0.66 # Propositional encoding time : 0.000
% 1.46/0.66 # Propositional solver time : 0.000
% 1.46/0.66 # Success case prop preproc time : 0.000
% 1.46/0.66 # Success case prop encoding time : 0.000
% 1.46/0.66 # Success case prop solver time : 0.000
% 1.46/0.66 # Current number of processed clauses : 689
% 1.46/0.66 # Positive orientable unit clauses : 561
% 1.46/0.66 # Positive unorientable unit clauses: 9
% 1.46/0.66 # Negative unit clauses : 1
% 1.46/0.66 # Non-unit-clauses : 118
% 1.46/0.66 # Current number of unprocessed clauses: 13017
% 1.46/0.66 # ...number of literals in the above : 15433
% 1.46/0.66 # Current number of archived formulas : 0
% 1.46/0.66 # Current number of archived clauses : 36
% 1.46/0.66 # Clause-clause subsumption calls (NU) : 4926
% 1.46/0.66 # Rec. Clause-clause subsumption calls : 4317
% 1.46/0.66 # Non-unit clause-clause subsumptions : 470
% 1.46/0.66 # Unit Clause-clause subsumption calls : 613
% 1.46/0.66 # Rewrite failures with RHS unbound : 0
% 1.46/0.66 # BW rewrite match attempts : 8754
% 1.46/0.66 # BW rewrite match successes : 196
% 1.46/0.66 # Condensation attempts : 0
% 1.46/0.66 # Condensation successes : 0
% 1.46/0.66 # Termbank termtop insertions : 360227
% 1.46/0.66 # Search garbage collected termcells : 34
% 1.46/0.66
% 1.46/0.66 # -------------------------------------------------
% 1.46/0.66 # User time : 0.172 s
% 1.46/0.66 # System time : 0.017 s
% 1.46/0.66 # Total time : 0.189 s
% 1.46/0.66 # Maximum resident set size: 1644 pages
% 1.46/0.66
% 1.46/0.66 # -------------------------------------------------
% 1.46/0.66 # User time : 0.892 s
% 1.46/0.66 # System time : 0.026 s
% 1.46/0.66 # Total time : 0.918 s
% 1.46/0.66 # Maximum resident set size: 1704 pages
% 1.46/0.66 % E---3.1 exiting
% 1.46/0.66 % E exiting
%------------------------------------------------------------------------------