TSTP Solution File: MSC008-2.002 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MSC008-2.002 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 18:39:14 EDT 2023
% Result : Unsatisfiable 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 81 ( 5 unt; 43 nHn; 58 RR)
% Number of literals : 225 ( 0 equ; 108 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 132 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(latin_column_is_unique,axiom,
( eq(X4,X2)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_column_is_unique) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p1)
| latin(X1,X2,p2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_cell_element) ).
cnf(greek_element_is_unique,axiom,
( eq(X4,X3)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',greek_element_is_unique) ).
cnf(greek_row_required,axiom,
( greek(p1,X1,X2)
| greek(p2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',greek_row_required) ).
cnf(greek_column_required,axiom,
( greek(X1,p1,X2)
| greek(X1,p2,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',greek_column_required) ).
cnf(latin_row_required,axiom,
( latin(p1,X1,X2)
| latin(p2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_row_required) ).
cnf(p1_is_not_p2,axiom,
~ eq(p1,p2),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',p1_is_not_p2) ).
cnf(latin_element_is_unique,axiom,
( eq(X4,X3)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_element_is_unique) ).
cnf(latin_row_is_unique,axiom,
( eq(X4,X1)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_row_is_unique) ).
cnf(latin_column_required,axiom,
( latin(X1,p1,X2)
| latin(X1,p2,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',latin_column_required) ).
cnf(greek_row_is_unique,axiom,
( eq(X4,X1)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',greek_row_is_unique) ).
cnf(symmetry,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',symmetry) ).
cnf(no_two_same,negated_conjecture,
( eq(X6,X2)
| eq(X5,X1)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',no_two_same) ).
cnf(greek_cell_element,axiom,
( greek(X1,X2,p1)
| greek(X1,X2,p2) ),
file('/export/starexec/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p',greek_cell_element) ).
cnf(c_0_14,axiom,
( eq(X4,X2)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
latin_column_is_unique ).
cnf(c_0_15,axiom,
( latin(X1,X2,p1)
| latin(X1,X2,p2) ),
latin_cell_element ).
cnf(c_0_16,axiom,
( eq(X4,X3)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
greek_element_is_unique ).
cnf(c_0_17,axiom,
( greek(p1,X1,X2)
| greek(p2,X1,X2) ),
greek_row_required ).
cnf(c_0_18,axiom,
( greek(X1,p1,X2)
| greek(X1,p2,X2) ),
greek_column_required ).
cnf(c_0_19,plain,
( latin(X1,X2,p1)
| eq(X2,X3)
| ~ latin(X1,X3,p2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
( latin(p1,X1,X2)
| latin(p2,X1,X2) ),
latin_row_required ).
cnf(c_0_21,plain,
( greek(p1,X1,X2)
| eq(X2,X3)
| ~ greek(p2,X1,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( greek(X1,p1,X2)
| eq(X2,X3)
| ~ greek(X1,p2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_23,axiom,
~ eq(p1,p2),
p1_is_not_p2 ).
cnf(c_0_24,plain,
( latin(p1,X1,p2)
| latin(p2,X2,p1)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( eq(X4,X3)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
latin_element_is_unique ).
cnf(c_0_26,plain,
( greek(p2,p1,X1)
| greek(p1,p2,X2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_27,plain,
( greek(p1,p2,X1)
| greek(p2,p1,X2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_28,axiom,
( eq(X4,X1)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
latin_row_is_unique ).
cnf(c_0_29,plain,
( latin(p2,p1,p1)
| latin(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( latin(p1,X1,X2)
| eq(X2,X3)
| ~ latin(p2,X1,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_31,axiom,
( latin(X1,p1,X2)
| latin(X1,p2,X2) ),
latin_column_required ).
cnf(c_0_32,axiom,
( eq(X4,X1)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
greek_row_is_unique ).
cnf(c_0_33,plain,
( greek(p1,p2,p1)
| greek(p2,p1,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_34,plain,
( greek(p2,p1,p1)
| greek(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_35,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
symmetry ).
cnf(c_0_36,plain,
( latin(p1,p2,p2)
| eq(p2,X1)
| ~ latin(X1,p1,p1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( latin(p2,p1,X1)
| latin(p1,p2,X2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( greek(p1,p2,p1)
| eq(p2,X1)
| ~ greek(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( greek(p1,p2,p2)
| eq(p2,X1)
| ~ greek(X1,p1,p1) ),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_40,plain,
( latin(p1,p2,p2)
| eq(X1,p2)
| ~ latin(X1,p1,p1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( latin(p1,p2,p1)
| latin(p2,p1,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_42,plain,
( greek(p1,p2,p1)
| eq(X1,p2)
| ~ greek(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_43,plain,
( greek(p1,p2,p2)
| eq(X1,p2)
| ~ greek(X1,p1,p1) ),
inference(spm,[status(thm)],[c_0_35,c_0_39]) ).
cnf(c_0_44,plain,
( latin(p1,p2,p2)
| ~ latin(p1,p1,p1) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_45,plain,
( latin(p1,p2,p1)
| eq(p2,X1)
| ~ latin(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_46,plain,
( greek(p1,p2,p1)
| ~ greek(p1,p1,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_47,plain,
( greek(p1,p2,p2)
| ~ greek(p1,p1,p1) ),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
cnf(c_0_48,plain,
( eq(p1,X1)
| ~ latin(p1,p1,p1)
| ~ latin(X1,p2,p2) ),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( eq(X6,X2)
| eq(X5,X1)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
no_two_same ).
cnf(c_0_50,plain,
( latin(p1,p2,p1)
| eq(X1,p2)
| ~ latin(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_35,c_0_45]) ).
cnf(c_0_51,plain,
( eq(p1,X1)
| ~ greek(p1,p1,p2)
| ~ greek(X1,p2,p1) ),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_52,plain,
( eq(p1,X1)
| ~ greek(p1,p1,p1)
| ~ greek(X1,p2,p2) ),
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_53,plain,
( ~ latin(p1,p1,p1)
| ~ latin(p2,p2,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( eq(p1,X1)
| eq(p2,X2)
| ~ greek(p1,p1,p2)
| ~ greek(X1,X2,p1)
| ~ latin(p1,p2,X3)
| ~ latin(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_55,plain,
( latin(p1,p2,p1)
| ~ latin(p1,p1,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_50]) ).
cnf(c_0_56,plain,
( ~ greek(p1,p1,p2)
| ~ greek(p2,p2,p1) ),
inference(spm,[status(thm)],[c_0_23,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( eq(p1,X1)
| eq(p2,X2)
| ~ greek(p1,p1,p1)
| ~ greek(X1,X2,p2)
| ~ latin(p1,p2,X3)
| ~ latin(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_58,plain,
( ~ greek(p1,p1,p1)
| ~ greek(p2,p2,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_59,plain,
( latin(X1,p1,X2)
| eq(X2,X3)
| ~ latin(X1,p2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_60,plain,
( latin(p2,p2,p1)
| ~ latin(p1,p1,p1) ),
inference(spm,[status(thm)],[c_0_53,c_0_15]) ).
cnf(c_0_61,negated_conjecture,
( eq(p2,X1)
| eq(p1,X2)
| ~ greek(p1,p1,p2)
| ~ greek(X2,X1,p1)
| ~ latin(p1,p1,p2)
| ~ latin(X2,X1,p1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
( greek(p2,p1,p1)
| ~ greek(p1,p1,p2) ),
inference(spm,[status(thm)],[c_0_56,c_0_18]) ).
cnf(c_0_63,plain,
( latin(X1,X2,p1)
| eq(X1,X3)
| ~ latin(X3,X2,p2) ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_64,negated_conjecture,
( eq(p2,X1)
| eq(p1,X2)
| ~ greek(p1,p1,p1)
| ~ greek(X2,X1,p2)
| ~ latin(p1,p1,p2)
| ~ latin(X2,X1,p1) ),
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
cnf(c_0_65,plain,
( greek(p2,p1,p2)
| ~ greek(p1,p1,p1) ),
inference(spm,[status(thm)],[c_0_58,c_0_18]) ).
cnf(c_0_66,negated_conjecture,
( eq(p2,X1)
| eq(p1,X2)
| ~ greek(p1,p1,p2)
| ~ greek(X2,X1,p1)
| ~ latin(p1,p1,p1)
| ~ latin(X2,X1,p2) ),
inference(spm,[status(thm)],[c_0_54,c_0_44]) ).
cnf(c_0_67,plain,
( latin(p2,p1,X1)
| eq(X1,p1)
| ~ latin(p1,p1,p1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( eq(p2,X1)
| eq(p1,X2)
| ~ greek(p1,p1,p1)
| ~ greek(X2,X1,p2)
| ~ latin(p1,p1,p1)
| ~ latin(X2,X1,p2) ),
inference(spm,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_69,negated_conjecture,
( eq(p2,p1)
| ~ greek(p1,p1,p2)
| ~ latin(p1,p1,p2) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_23]),c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( eq(p2,p1)
| ~ greek(p1,p1,p1)
| ~ latin(p1,p1,p2) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_23]),c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( eq(p2,p1)
| ~ greek(p1,p1,p2)
| ~ latin(p1,p1,p1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_62]),c_0_23]),c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( eq(p2,p1)
| ~ greek(p1,p1,p1)
| ~ latin(p1,p1,p1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_65]),c_0_23]),c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( ~ greek(p1,p1,p2)
| ~ latin(p1,p1,p2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_69]),c_0_23]) ).
cnf(c_0_74,axiom,
( greek(X1,X2,p1)
| greek(X1,X2,p2) ),
greek_cell_element ).
cnf(c_0_75,negated_conjecture,
( ~ greek(p1,p1,p1)
| ~ latin(p1,p1,p2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_70]),c_0_23]) ).
cnf(c_0_76,negated_conjecture,
( ~ greek(p1,p1,p2)
| ~ latin(p1,p1,p1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_71]),c_0_23]) ).
cnf(c_0_77,negated_conjecture,
( ~ greek(p1,p1,p1)
| ~ latin(p1,p1,p1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_72]),c_0_23]) ).
cnf(c_0_78,negated_conjecture,
~ latin(p1,p1,p2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_79,negated_conjecture,
~ latin(p1,p1,p1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_15]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC008-2.002 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 11:37:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.iqI44iZtGt/E---3.1_18877.p
% 0.19/0.53 # Version: 3.1pre001
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # new_bool_3 with pid 18955 completed with status 0
% 0.19/0.53 # Result found by new_bool_3
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.19/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53 # SAT001_MinMin_p005000_rr_RG with pid 18960 completed with status 0
% 0.19/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.19/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53 # Preprocessing time : 0.001 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Unsatisfiable
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 16
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 16
% 0.19/0.53 # Removed in clause preprocessing : 0
% 0.19/0.53 # Initial clauses in saturation : 16
% 0.19/0.53 # Processed clauses : 683
% 0.19/0.53 # ...of these trivial : 0
% 0.19/0.53 # ...subsumed : 306
% 0.19/0.53 # ...remaining for further processing : 377
% 0.19/0.53 # Other redundant clauses eliminated : 0
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 97
% 0.19/0.53 # Backward-rewritten : 0
% 0.19/0.53 # Generated clauses : 2365
% 0.19/0.53 # ...of the previous two non-redundant : 1919
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 7
% 0.19/0.53 # Paramodulations : 2336
% 0.19/0.53 # Factorizations : 24
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 0
% 0.19/0.53 # Total rewrite steps : 451
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 259
% 0.19/0.53 # Positive orientable unit clauses : 1
% 0.19/0.53 # Positive unorientable unit clauses: 0
% 0.19/0.53 # Negative unit clauses : 3
% 0.19/0.53 # Non-unit-clauses : 255
% 0.19/0.53 # Current number of unprocessed clauses: 1259
% 0.19/0.53 # ...number of literals in the above : 6348
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 118
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 18224
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 9246
% 0.19/0.53 # Non-unit clause-clause subsumptions : 327
% 0.19/0.53 # Unit Clause-clause subsumption calls : 113
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 0
% 0.19/0.53 # BW rewrite match successes : 0
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 35526
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.069 s
% 0.19/0.53 # System time : 0.001 s
% 0.19/0.53 # Total time : 0.070 s
% 0.19/0.53 # Maximum resident set size: 1640 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.069 s
% 0.19/0.53 # System time : 0.004 s
% 0.19/0.53 # Total time : 0.073 s
% 0.19/0.53 # Maximum resident set size: 1684 pages
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------