TSTP Solution File: SYN417+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN417+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 20:30:15 EDT 2023
% Result : Theorem 408.28s 136.58s
% Output : CNFRefutation 408.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 1
% Syntax : Number of formulae : 61 ( 6 unt; 0 def)
% Number of atoms : 210 ( 209 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 216 ( 67 ~; 132 |; 11 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 54 ( 0 sgn; 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cute,conjecture,
( ? [X1] :
( X1 = f(g(X1))
& ! [X2] :
( X2 = f(g(X2))
=> X1 = X2 ) )
<=> ? [X1] :
( X1 = g(f(X1))
& ! [X2] :
( X2 = g(f(X2))
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WqwFEceLkp/E---3.1_9238.p',cute) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] :
( X1 = f(g(X1))
& ! [X2] :
( X2 = f(g(X2))
=> X1 = X2 ) )
<=> ? [X1] :
( X1 = g(f(X1))
& ! [X2] :
( X2 = g(f(X2))
=> X1 = X2 ) ) ),
inference(assume_negation,[status(cth)],[cute]) ).
fof(c_0_2,negated_conjecture,
! [X3,X5,X8,X10] :
( ( esk2_1(X5) = g(f(esk2_1(X5)))
| X5 != g(f(X5))
| esk1_1(X3) = f(g(esk1_1(X3)))
| X3 != f(g(X3)) )
& ( X5 != esk2_1(X5)
| X5 != g(f(X5))
| esk1_1(X3) = f(g(esk1_1(X3)))
| X3 != f(g(X3)) )
& ( esk2_1(X5) = g(f(esk2_1(X5)))
| X5 != g(f(X5))
| X3 != esk1_1(X3)
| X3 != f(g(X3)) )
& ( X5 != esk2_1(X5)
| X5 != g(f(X5))
| X3 != esk1_1(X3)
| X3 != f(g(X3)) )
& ( esk4_0 = g(f(esk4_0))
| esk3_0 = f(g(esk3_0)) )
& ( X10 != g(f(X10))
| esk4_0 = X10
| esk3_0 = f(g(esk3_0)) )
& ( esk4_0 = g(f(esk4_0))
| X8 != f(g(X8))
| esk3_0 = X8 )
& ( X10 != g(f(X10))
| esk4_0 = X10
| X8 != f(g(X8))
| esk3_0 = X8 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( esk2_1(X1) = g(f(esk2_1(X1)))
| esk1_1(X2) = f(g(esk1_1(X2)))
| X1 != g(f(X1))
| X2 != f(g(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( esk4_0 = g(f(esk4_0))
| esk3_0 = f(g(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(esk4_0)) = esk4_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( esk4_0 = g(f(esk4_0))
| esk3_0 = X1
| X1 != f(g(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( g(f(esk2_1(g(esk3_0)))) = esk2_1(g(esk3_0))
| f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| f(esk2_1(g(esk3_0))) = esk3_0
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| esk2_1(g(esk3_0)) = g(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( esk2_1(g(esk3_0)) = g(esk3_0)
| g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( esk1_1(X2) = f(g(esk1_1(X2)))
| X1 != esk2_1(X1)
| X1 != g(f(X1))
| X2 != f(g(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( g(f(g(esk3_0))) = g(esk3_0)
| g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0
| f(g(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0
| esk1_1(X1) = esk3_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( esk2_1(X1) = g(f(esk2_1(X1)))
| X1 != g(f(X1))
| X2 != esk1_1(X2)
| X2 != f(g(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(esk4_0)) = esk4_0
| g(f(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( X1 != esk2_1(X1)
| X1 != g(f(X1))
| X2 != esk1_1(X2)
| X2 != f(g(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| f(esk2_1(X1)) = esk3_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| g(f(X1)) != X1
| esk2_1(X1) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk2_1(X1) = g(esk3_0)
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| g(f(g(esk3_0))) != g(esk3_0) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
g(f(esk4_0)) = esk4_0,
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_24,negated_conjecture,
( esk4_0 = X1
| esk3_0 = X2
| X1 != g(f(X1))
| X2 != f(g(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_25,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( f(esk4_0) = esk3_0
| esk4_0 = X1
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| g(f(esk2_1(esk4_0))) = esk2_1(esk4_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| g(esk1_1(f(esk4_0))) = esk4_0
| f(esk4_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| esk1_1(f(esk4_0)) = f(esk4_0)
| f(esk4_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( esk1_1(f(esk4_0)) = f(esk4_0)
| esk2_1(esk4_0) = esk4_0
| f(esk4_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| f(esk4_0) = esk3_0
| esk2_1(esk4_0) = esk4_0
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_30]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( esk2_1(esk4_0) = esk4_0
| f(esk4_0) = esk3_0
| esk2_1(X1) = esk4_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( f(esk4_0) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| f(esk4_0) = esk3_0
| f(g(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
( g(esk1_1(X1)) = esk4_0
| f(esk4_0) = esk3_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| esk1_1(f(esk4_0)) = esk3_0
| esk4_0 = X1
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
( esk1_1(X1) = f(esk4_0)
| f(esk4_0) = esk3_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| g(esk1_1(f(esk4_0))) = esk4_0
| esk1_1(f(esk4_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( f(esk4_0) = esk3_0
| g(f(X1)) != X1
| esk2_1(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_37])]),c_0_23])]) ).
cnf(c_0_40,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| esk1_1(f(esk4_0)) = f(esk4_0)
| esk1_1(f(esk4_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
f(esk4_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_23])]) ).
cnf(c_0_42,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| esk1_1(esk3_0) = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]),c_0_41])]) ).
cnf(c_0_43,negated_conjecture,
( f(esk2_1(esk4_0)) = esk3_0
| esk1_1(esk3_0) = esk3_0
| esk4_0 = X1
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( f(esk2_1(esk4_0)) = esk3_0
| esk2_1(esk4_0) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
g(esk3_0) = esk4_0,
inference(rw,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( esk1_1(esk3_0) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_44]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| esk1_1(esk3_0) = esk3_0
| f(g(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_46]),c_0_41]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
( esk1_1(esk3_0) = esk3_0
| esk1_1(X1) = esk3_0
| esk4_0 = X2
| g(f(X2)) != X2
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( g(esk1_1(X1)) = esk4_0
| esk1_1(esk3_0) = esk3_0
| esk1_1(X2) = esk3_0
| f(g(X2)) != X2
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( g(esk1_1(X1)) = esk4_0
| esk1_1(esk3_0) = esk3_0
| f(g(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_41])]) ).
cnf(c_0_51,negated_conjecture,
( esk1_1(esk3_0) = esk3_0
| esk1_1(X1) = esk3_0
| f(g(X1)) != X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_50]),c_0_41]) ).
cnf(c_0_52,negated_conjecture,
esk1_1(esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_41])]) ).
cnf(c_0_53,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_52]),c_0_45]),c_0_41])]) ).
cnf(c_0_54,negated_conjecture,
( f(esk2_1(X1)) = esk3_0
| esk4_0 = X2
| g(f(X2)) != X2
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
( f(esk2_1(X1)) = esk3_0
| esk2_1(X2) = esk4_0
| g(f(X1)) != X1
| g(f(X2)) != X2 ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( f(esk2_1(esk4_0)) = esk3_0
| esk2_1(X1) = esk4_0
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_45])]) ).
cnf(c_0_57,negated_conjecture,
( f(esk2_1(esk4_0)) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_45])]) ).
cnf(c_0_58,negated_conjecture,
( g(f(X1)) != X1
| esk2_1(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_52]),c_0_45]),c_0_41])]) ).
cnf(c_0_59,negated_conjecture,
esk2_1(esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_57]),c_0_45]),c_0_41]),c_0_45])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_41]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : SYN417+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.18 % Command : run_E %s %d THM
% 0.17/0.40 % Computer : n019.cluster.edu
% 0.17/0.40 % Model : x86_64 x86_64
% 0.17/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.40 % Memory : 8042.1875MB
% 0.17/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.40 % CPULimit : 2400
% 0.17/0.40 % WCLimit : 300
% 0.17/0.40 % DateTime : Mon Oct 2 18:35:36 EDT 2023
% 0.17/0.40 % CPUTime :
% 0.24/0.56 Running first-order model finding
% 0.24/0.56 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.WqwFEceLkp/E---3.1_9238.p
% 408.28/136.58 # Version: 3.1pre001
% 408.28/136.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/136.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/136.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/136.58 # Starting new_bool_3 with 300s (1) cores
% 408.28/136.58 # Starting new_bool_1 with 300s (1) cores
% 408.28/136.58 # Starting sh5l with 300s (1) cores
% 408.28/136.58 # sh5l with pid 9318 completed with status 0
% 408.28/136.58 # Result found by sh5l
% 408.28/136.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/136.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/136.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/136.58 # Starting new_bool_3 with 300s (1) cores
% 408.28/136.58 # Starting new_bool_1 with 300s (1) cores
% 408.28/136.58 # Starting sh5l with 300s (1) cores
% 408.28/136.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.28/136.58 # Search class: FGHPF-FFSF11-MFFFFFNN
% 408.28/136.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/136.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/136.58 # SAT001_MinMin_p005000_rr_RG with pid 9319 completed with status 0
% 408.28/136.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.28/136.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/136.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/136.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/136.58 # Starting new_bool_3 with 300s (1) cores
% 408.28/136.58 # Starting new_bool_1 with 300s (1) cores
% 408.28/136.58 # Starting sh5l with 300s (1) cores
% 408.28/136.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.28/136.58 # Search class: FGHPF-FFSF11-MFFFFFNN
% 408.28/136.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/136.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/136.58 # Preprocessing time : 0.001 s
% 408.28/136.58 # Presaturation interreduction done
% 408.28/136.58
% 408.28/136.58 # Proof found!
% 408.28/136.58 # SZS status Theorem
% 408.28/136.58 # SZS output start CNFRefutation
% See solution above
% 408.28/136.58 # Parsed axioms : 1
% 408.28/136.58 # Removed by relevancy pruning/SinE : 0
% 408.28/136.58 # Initial clauses : 8
% 408.28/136.58 # Removed in clause preprocessing : 0
% 408.28/136.58 # Initial clauses in saturation : 8
% 408.28/136.58 # Processed clauses : 140
% 408.28/136.58 # ...of these trivial : 4
% 408.28/136.58 # ...subsumed : 38
% 408.28/136.58 # ...remaining for further processing : 98
% 408.28/136.58 # Other redundant clauses eliminated : 4
% 408.28/136.58 # Clauses deleted for lack of memory : 0
% 408.28/136.58 # Backward-subsumed : 29
% 408.28/136.58 # Backward-rewritten : 52
% 408.28/136.58 # Generated clauses : 373
% 408.28/136.58 # ...of the previous two non-redundant : 306
% 408.28/136.58 # ...aggressively subsumed : 0
% 408.28/136.58 # Contextual simplify-reflections : 6
% 408.28/136.58 # Paramodulations : 369
% 408.28/136.58 # Factorizations : 0
% 408.28/136.58 # NegExts : 0
% 408.28/136.58 # Equation resolutions : 4
% 408.28/136.58 # Total rewrite steps : 323
% 408.28/136.58 # Propositional unsat checks : 0
% 408.28/136.58 # Propositional check models : 0
% 408.28/136.58 # Propositional check unsatisfiable : 0
% 408.28/136.58 # Propositional clauses : 0
% 408.28/136.58 # Propositional clauses after purity: 0
% 408.28/136.58 # Propositional unsat core size : 0
% 408.28/136.58 # Propositional preprocessing time : 0.000
% 408.28/136.58 # Propositional encoding time : 0.000
% 408.28/136.58 # Propositional solver time : 0.000
% 408.28/136.58 # Success case prop preproc time : 0.000
% 408.28/136.58 # Success case prop encoding time : 0.000
% 408.28/136.58 # Success case prop solver time : 0.000
% 408.28/136.58 # Current number of processed clauses : 9
% 408.28/136.58 # Positive orientable unit clauses : 4
% 408.28/136.58 # Positive unorientable unit clauses: 0
% 408.28/136.58 # Negative unit clauses : 0
% 408.28/136.58 # Non-unit-clauses : 5
% 408.28/136.58 # Current number of unprocessed clauses: 6
% 408.28/136.58 # ...number of literals in the above : 21
% 408.28/136.58 # Current number of archived formulas : 0
% 408.28/136.58 # Current number of archived clauses : 89
% 408.28/136.58 # Clause-clause subsumption calls (NU) : 451
% 408.28/136.58 # Rec. Clause-clause subsumption calls : 244
% 408.28/136.58 # Non-unit clause-clause subsumptions : 73
% 408.28/136.58 # Unit Clause-clause subsumption calls : 5
% 408.28/136.58 # Rewrite failures with RHS unbound : 0
% 408.28/136.58 # BW rewrite match attempts : 5
% 408.28/136.58 # BW rewrite match successes : 5
% 408.28/136.58 # Condensation attempts : 0
% 408.28/136.58 # Condensation successes : 0
% 408.28/136.58 # Termbank termtop insertions : 8437
% 408.28/136.58
% 408.28/136.58 # -------------------------------------------------
% 408.28/136.58 # User time : 0.011 s
% 408.28/136.58 # System time : 0.000 s
% 408.28/136.58 # Total time : 0.011 s
% 408.28/136.58 # Maximum resident set size: 1760 pages
% 408.28/136.58
% 408.28/136.58 # -------------------------------------------------
% 408.28/136.58 # User time : 0.011 s
% 408.28/136.58 # System time : 0.004 s
% 408.28/136.58 # Total time : 0.015 s
% 408.28/136.58 # Maximum resident set size: 1668 pages
% 408.28/136.58 % E---3.1 exiting
%------------------------------------------------------------------------------