TSTP Solution File: SYN171-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN171-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Sat May 4 10:19:32 EDT 2024
% Result : Unsatisfiable 0.97s 0.55s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 106 ( 38 unt; 0 nHn; 88 RR)
% Number of literals : 236 ( 0 equ; 135 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 160 ( 46 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_125) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_14) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_19) ).
cnf(rule_190,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_36) ).
cnf(rule_260,axiom,
( r3(X1,X2,X2)
| ~ s2(X2)
| ~ l2(c,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_260) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_1) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_124) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_117) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_107) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_28) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_129) ).
cnf(rule_225,axiom,
( m3(X1,X2,X1)
| ~ m0(X3,X3,X2)
| ~ l2(X4,X1)
| ~ m0(X1,X4,X4)
| ~ s2(X3) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_225) ).
cnf(rule_272,axiom,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_272) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_188) ).
cnf(rule_194,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_194) ).
cnf(rule_288,axiom,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1)
| ~ p4(X3,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_288) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_287) ).
cnf(rule_268,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_268) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_12) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ p4(d,a,a),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',prove_this) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_002) ).
cnf(rule_135,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',rule_135) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/tmp/tmp.7hJkiD2BnM/E---3.1_15297.p',axiom_34) ).
cnf(c_0_28,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_29,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_30,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_28 ).
cnf(c_0_31,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_32,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_29 ).
cnf(c_0_33,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_34,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_35,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
s1(b),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
c_0_34 ).
cnf(c_0_38,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_40,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_41,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_42,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_43,plain,
( r3(X1,X2,X2)
| ~ s2(X2)
| ~ l2(c,X1) ),
inference(fof_simplification,[status(thm)],[rule_260]) ).
cnf(c_0_44,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
c_0_41 ).
cnf(c_0_46,axiom,
s0(d),
axiom_1 ).
cnf(c_0_47,plain,
( s1(a)
| ~ s1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_48,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_49,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_117]) ).
cnf(c_0_50,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_51,plain,
( r3(X1,X2,X2)
| ~ s2(X2)
| ~ l2(c,X1) ),
c_0_43 ).
cnf(c_0_52,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_53,plain,
( s2(d)
| ~ s1(a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_54,plain,
s1(a),
inference(spm,[status(thm)],[c_0_47,c_0_36]) ).
cnf(c_0_55,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
c_0_48 ).
cnf(c_0_56,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
c_0_49 ).
cnf(c_0_57,axiom,
k0(e),
axiom_28 ).
cnf(c_0_58,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_59,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
c_0_50 ).
cnf(c_0_60,plain,
( m3(X1,X2,X1)
| ~ m0(X3,X3,X2)
| ~ l2(X4,X1)
| ~ m0(X1,X4,X4)
| ~ s2(X3) ),
inference(fof_simplification,[status(thm)],[rule_225]) ).
cnf(c_0_61,plain,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_272]) ).
cnf(c_0_62,plain,
( r3(c,X1,X1)
| ~ s2(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_63,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_64,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_65,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_46])]) ).
cnf(c_0_66,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_46]),c_0_57])]) ).
cnf(c_0_67,plain,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_194]) ).
cnf(c_0_68,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
c_0_58 ).
cnf(c_0_69,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_40]),c_0_40])]) ).
cnf(c_0_70,plain,
( m3(X1,X2,X1)
| ~ m0(X3,X3,X2)
| ~ l2(X4,X1)
| ~ m0(X1,X4,X4)
| ~ s2(X3) ),
c_0_60 ).
cnf(c_0_71,plain,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
c_0_61 ).
cnf(c_0_72,plain,
r3(c,d,d),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_73,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
c_0_64 ).
cnf(c_0_74,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_31]),c_0_66])]) ).
cnf(c_0_75,plain,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1)
| ~ p4(X3,X3,X4) ),
inference(fof_simplification,[status(thm)],[rule_288]) ).
cnf(c_0_76,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_287]) ).
cnf(c_0_77,plain,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
c_0_67 ).
cnf(c_0_78,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,plain,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
inference(fof_simplification,[status(thm)],[rule_268]) ).
cnf(c_0_80,plain,
( m3(X1,X2,X1)
| ~ l2(X3,X1)
| ~ m0(X1,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_40]),c_0_63])]) ).
cnf(c_0_81,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_82,plain,
( r3(d,X1,c)
| ~ r2(c)
| ~ k2(X1,c) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_83,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_84,axiom,
l0(c),
axiom_24 ).
cnf(c_0_85,negated_conjecture,
~ p4(d,a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_86,plain,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1)
| ~ p4(X3,X3,X4) ),
c_0_75 ).
cnf(c_0_87,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
c_0_76 ).
cnf(c_0_88,plain,
k3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_89,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_90,plain,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
c_0_79 ).
cnf(c_0_91,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_52])]) ).
cnf(c_0_92,plain,
( r3(d,X1,c)
| ~ k2(X1,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_93,negated_conjecture,
~ p4(d,a,a),
c_0_85 ).
cnf(c_0_94,plain,
( p4(X1,X2,X2)
| ~ r3(X2,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88])]) ).
cnf(c_0_95,plain,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_135]) ).
cnf(c_0_96,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_89 ).
cnf(c_0_97,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_98,plain,
( r3(a,a,X1)
| ~ r3(X1,X2,X2)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_99,plain,
r3(d,c,c),
inference(spm,[status(thm)],[c_0_92,c_0_78]) ).
cnf(c_0_100,negated_conjecture,
~ r3(a,a,d),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,plain,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
c_0_95 ).
cnf(c_0_102,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,plain,
~ m2(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).
cnf(c_0_104,plain,
( m2(X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SYN171-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 10:41:54 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.7hJkiD2BnM/E---3.1_15297.p
% 0.97/0.55 # Version: 3.1.0
% 0.97/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.97/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.97/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.97/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.97/0.55 # Starting sh5l with 300s (1) cores
% 0.97/0.55 # new_bool_1 with pid 15378 completed with status 0
% 0.97/0.55 # Result found by new_bool_1
% 0.97/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.97/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.97/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.97/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.97/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.97/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.97/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.97/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.97/0.55 # SAT001_MinMin_p005000_rr_RG with pid 15386 completed with status 0
% 0.97/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.97/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.97/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.97/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.97/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.97/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.97/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.97/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.97/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.97/0.55 # Preprocessing time : 0.004 s
% 0.97/0.55 # Presaturation interreduction done
% 0.97/0.55
% 0.97/0.55 # Proof found!
% 0.97/0.55 # SZS status Unsatisfiable
% 0.97/0.55 # SZS output start CNFRefutation
% See solution above
% 0.97/0.55 # Parsed axioms : 369
% 0.97/0.55 # Removed by relevancy pruning/SinE : 39
% 0.97/0.55 # Initial clauses : 330
% 0.97/0.55 # Removed in clause preprocessing : 6
% 0.97/0.55 # Initial clauses in saturation : 324
% 0.97/0.55 # Processed clauses : 1394
% 0.97/0.55 # ...of these trivial : 77
% 0.97/0.55 # ...subsumed : 104
% 0.97/0.55 # ...remaining for further processing : 1213
% 0.97/0.55 # Other redundant clauses eliminated : 0
% 0.97/0.55 # Clauses deleted for lack of memory : 0
% 0.97/0.55 # Backward-subsumed : 95
% 0.97/0.55 # Backward-rewritten : 289
% 0.97/0.55 # Generated clauses : 1974
% 0.97/0.55 # ...of the previous two non-redundant : 1336
% 0.97/0.55 # ...aggressively subsumed : 0
% 0.97/0.55 # Contextual simplify-reflections : 1
% 0.97/0.55 # Paramodulations : 1974
% 0.97/0.55 # Factorizations : 0
% 0.97/0.55 # NegExts : 0
% 0.97/0.55 # Equation resolutions : 0
% 0.97/0.55 # Disequality decompositions : 0
% 0.97/0.55 # Total rewrite steps : 1468
% 0.97/0.55 # ...of those cached : 1082
% 0.97/0.55 # Propositional unsat checks : 0
% 0.97/0.55 # Propositional check models : 0
% 0.97/0.55 # Propositional check unsatisfiable : 0
% 0.97/0.55 # Propositional clauses : 0
% 0.97/0.55 # Propositional clauses after purity: 0
% 0.97/0.55 # Propositional unsat core size : 0
% 0.97/0.55 # Propositional preprocessing time : 0.000
% 0.97/0.55 # Propositional encoding time : 0.000
% 0.97/0.55 # Propositional solver time : 0.000
% 0.97/0.55 # Success case prop preproc time : 0.000
% 0.97/0.55 # Success case prop encoding time : 0.000
% 0.97/0.55 # Success case prop solver time : 0.000
% 0.97/0.55 # Current number of processed clauses : 539
% 0.97/0.55 # Positive orientable unit clauses : 234
% 0.97/0.55 # Positive unorientable unit clauses: 0
% 0.97/0.55 # Negative unit clauses : 3
% 0.97/0.55 # Non-unit-clauses : 302
% 0.97/0.55 # Current number of unprocessed clauses: 145
% 0.97/0.55 # ...number of literals in the above : 456
% 0.97/0.55 # Current number of archived formulas : 0
% 0.97/0.55 # Current number of archived clauses : 674
% 0.97/0.55 # Clause-clause subsumption calls (NU) : 50957
% 0.97/0.55 # Rec. Clause-clause subsumption calls : 39083
% 0.97/0.55 # Non-unit clause-clause subsumptions : 186
% 0.97/0.55 # Unit Clause-clause subsumption calls : 3439
% 0.97/0.55 # Rewrite failures with RHS unbound : 0
% 0.97/0.55 # BW rewrite match attempts : 673
% 0.97/0.55 # BW rewrite match successes : 193
% 0.97/0.55 # Condensation attempts : 0
% 0.97/0.55 # Condensation successes : 0
% 0.97/0.55 # Termbank termtop insertions : 33516
% 0.97/0.55 # Search garbage collected termcells : 1510
% 0.97/0.55
% 0.97/0.55 # -------------------------------------------------
% 0.97/0.55 # User time : 0.087 s
% 0.97/0.55 # System time : 0.007 s
% 0.97/0.55 # Total time : 0.094 s
% 0.97/0.55 # Maximum resident set size: 2616 pages
% 0.97/0.55
% 0.97/0.55 # -------------------------------------------------
% 0.97/0.55 # User time : 0.092 s
% 0.97/0.55 # System time : 0.009 s
% 0.97/0.55 # Total time : 0.101 s
% 0.97/0.55 # Maximum resident set size: 2012 pages
% 0.97/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------