TSTP Solution File: SYN158-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN158-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:06:36 EDT 2024
% Result : Unsatisfiable 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 30
% Syntax : Number of clauses : 116 ( 37 unt; 0 nHn; 97 RR)
% Number of literals : 251 ( 0 equ; 139 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 179 ( 61 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_001) ).
cnf(rule_159,axiom,
( p2(X1,X1,X1)
| ~ k1(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_159) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_37) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_124) ).
cnf(rule_110,axiom,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_110) ).
cnf(rule_035,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_035) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_267) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_1) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_19) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_20) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_107) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_085) ).
cnf(rule_272,axiom,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_272) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_188) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_17) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_127) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_13) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_129) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_125) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_14) ).
cnf(rule_236,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_236) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_133) ).
cnf(rule_284,axiom,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_284) ).
cnf(rule_276,axiom,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_276) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_258) ).
cnf(axiom_16,axiom,
m0(c,b,a),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',axiom_16) ).
cnf(rule_309,axiom,
( n5(X1,X1)
| ~ n4(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',rule_309) ).
cnf(prove_this,negated_conjecture,
~ n5(a,a),
file('/export/starexec/sandbox2/tmp/tmp.GUCxuw66kl/E---3.1_7681.p',prove_this) ).
cnf(c_0_30,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_31,plain,
( p2(X1,X1,X1)
| ~ k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_159]) ).
cnf(c_0_32,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_30 ).
cnf(c_0_33,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_34,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_35,plain,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_36,plain,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
inference(fof_simplification,[status(thm)],[rule_035]) ).
cnf(c_0_37,plain,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_38,plain,
( p2(X1,X1,X1)
| ~ k1(X1) ),
c_0_31 ).
cnf(c_0_39,plain,
k1(a),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
c_0_34 ).
cnf(c_0_41,axiom,
s0(d),
axiom_1 ).
cnf(c_0_42,plain,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
c_0_35 ).
cnf(c_0_43,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_44,plain,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
c_0_36 ).
cnf(c_0_45,axiom,
l0(a),
axiom_20 ).
cnf(c_0_46,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_47,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_48,plain,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_272]) ).
cnf(c_0_49,plain,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
c_0_37 ).
cnf(c_0_50,plain,
p2(a,a,a),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_51,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_52,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_53,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_54,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_55,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_56,plain,
( m1(X1,a,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_57,axiom,
r0(e),
axiom_13 ).
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_46 ).
cnf(c_0_60,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_61,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_62,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_63,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
c_0_47 ).
cnf(c_0_64,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_65,plain,
( r3(X1,X2,X3)
| ~ k2(X2,X3)
| ~ r2(X3)
| ~ r3(X3,X1,X1) ),
c_0_48 ).
cnf(c_0_66,plain,
r3(a,a,a),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_67,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
c_0_51 ).
cnf(c_0_68,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_69,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
c_0_55 ).
cnf(c_0_70,plain,
m1(e,a,e),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_71,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
c_0_58 ).
cnf(c_0_72,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_43]),c_0_43])]) ).
cnf(c_0_73,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_60 ).
cnf(c_0_74,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_61 ).
cnf(c_0_75,plain,
( m3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_76,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_62 ).
cnf(c_0_77,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_78,plain,
( r3(a,X1,a)
| ~ r2(a)
| ~ k2(X1,a) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_79,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_80,plain,
( k2(e,a)
| ~ k2(X1,a)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_81,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_82,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_83,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_53]) ).
cnf(c_0_84,plain,
s1(b),
inference(spm,[status(thm)],[c_0_74,c_0_64]) ).
cnf(c_0_85,plain,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_284]) ).
cnf(c_0_86,plain,
( m3(X1,X1,X1)
| ~ n2(X1) ),
c_0_75 ).
cnf(c_0_87,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_88,plain,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
inference(fof_simplification,[status(thm)],[rule_276]) ).
cnf(c_0_89,plain,
( r3(a,X1,a)
| ~ k2(X1,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_45])]) ).
cnf(c_0_90,plain,
k2(e,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_39])]) ).
cnf(c_0_91,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
c_0_82 ).
cnf(c_0_92,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_93,plain,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
c_0_85 ).
cnf(c_0_94,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_95,plain,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
c_0_88 ).
cnf(c_0_96,plain,
r3(a,e,a),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_97,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
inference(fof_simplification,[status(thm)],[rule_258]) ).
cnf(c_0_98,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_99,axiom,
m0(c,b,a),
axiom_16 ).
cnf(c_0_100,plain,
( n5(X1,X1)
| ~ n4(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_309]) ).
cnf(c_0_101,plain,
( n4(X1,X1)
| ~ k4(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]) ).
cnf(c_0_102,plain,
( k4(e)
| ~ q3(a,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_54])]) ).
cnf(c_0_103,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
c_0_97 ).
cnf(c_0_104,plain,
( l2(a,a)
| ~ p0(X1,X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_105,plain,
( n5(X1,X1)
| ~ n4(X2,X1) ),
c_0_100 ).
cnf(c_0_106,plain,
( n4(X1,X1)
| ~ q3(a,a) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_107,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_92])]) ).
cnf(c_0_108,plain,
l2(a,a),
inference(spm,[status(thm)],[c_0_104,c_0_64]) ).
cnf(c_0_109,negated_conjecture,
~ n5(a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_110,plain,
( n5(X1,X1)
| ~ q3(a,a) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_112,negated_conjecture,
~ n5(a,a),
c_0_109 ).
cnf(c_0_113,plain,
( n5(X1,X1)
| ~ r2(a) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,negated_conjecture,
~ r2(a),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_115,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_79]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SYN158-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.16 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n021.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 10:46:28 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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/tmp/tmp.GUCxuw66kl/E---3.1_7681.p
% 0.22/0.59 # Version: 3.1.0
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # new_bool_3 with pid 7820 completed with status 0
% 0.22/0.59 # Result found by new_bool_3
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.59 # SAT001_MinMin_p005000_rr_RG with pid 7831 completed with status 0
% 0.22/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.59 # Preprocessing time : 0.005 s
% 0.22/0.59 # Presaturation interreduction done
% 0.22/0.59
% 0.22/0.59 # Proof found!
% 0.22/0.59 # SZS status Unsatisfiable
% 0.22/0.59 # SZS output start CNFRefutation
% See solution above
% 0.22/0.59 # Parsed axioms : 369
% 0.22/0.59 # Removed by relevancy pruning/SinE : 26
% 0.22/0.59 # Initial clauses : 343
% 0.22/0.59 # Removed in clause preprocessing : 6
% 0.22/0.59 # Initial clauses in saturation : 337
% 0.22/0.59 # Processed clauses : 806
% 0.22/0.59 # ...of these trivial : 38
% 0.22/0.59 # ...subsumed : 25
% 0.22/0.59 # ...remaining for further processing : 743
% 0.22/0.59 # Other redundant clauses eliminated : 0
% 0.22/0.59 # Clauses deleted for lack of memory : 0
% 0.22/0.59 # Backward-subsumed : 26
% 0.22/0.59 # Backward-rewritten : 140
% 0.22/0.59 # Generated clauses : 721
% 0.22/0.59 # ...of the previous two non-redundant : 425
% 0.22/0.59 # ...aggressively subsumed : 0
% 0.22/0.59 # Contextual simplify-reflections : 2
% 0.22/0.59 # Paramodulations : 721
% 0.22/0.59 # Factorizations : 0
% 0.22/0.59 # NegExts : 0
% 0.22/0.59 # Equation resolutions : 0
% 0.22/0.59 # Disequality decompositions : 0
% 0.22/0.59 # Total rewrite steps : 664
% 0.22/0.59 # ...of those cached : 464
% 0.22/0.59 # Propositional unsat checks : 0
% 0.22/0.59 # Propositional check models : 0
% 0.22/0.59 # Propositional check unsatisfiable : 0
% 0.22/0.59 # Propositional clauses : 0
% 0.22/0.59 # Propositional clauses after purity: 0
% 0.22/0.59 # Propositional unsat core size : 0
% 0.22/0.59 # Propositional preprocessing time : 0.000
% 0.22/0.59 # Propositional encoding time : 0.000
% 0.22/0.59 # Propositional solver time : 0.000
% 0.22/0.59 # Success case prop preproc time : 0.000
% 0.22/0.59 # Success case prop encoding time : 0.000
% 0.22/0.59 # Success case prop solver time : 0.000
% 0.22/0.59 # Current number of processed clauses : 274
% 0.22/0.59 # Positive orientable unit clauses : 102
% 0.22/0.59 # Positive unorientable unit clauses: 0
% 0.22/0.59 # Negative unit clauses : 3
% 0.22/0.59 # Non-unit-clauses : 169
% 0.22/0.59 # Current number of unprocessed clauses: 225
% 0.22/0.59 # ...number of literals in the above : 589
% 0.22/0.59 # Current number of archived formulas : 0
% 0.22/0.59 # Current number of archived clauses : 469
% 0.22/0.59 # Clause-clause subsumption calls (NU) : 32832
% 0.22/0.59 # Rec. Clause-clause subsumption calls : 23513
% 0.22/0.59 # Non-unit clause-clause subsumptions : 43
% 0.22/0.59 # Unit Clause-clause subsumption calls : 1350
% 0.22/0.59 # Rewrite failures with RHS unbound : 0
% 0.22/0.59 # BW rewrite match attempts : 196
% 0.22/0.59 # BW rewrite match successes : 97
% 0.22/0.59 # Condensation attempts : 0
% 0.22/0.59 # Condensation successes : 0
% 0.22/0.59 # Termbank termtop insertions : 20153
% 0.22/0.59 # Search garbage collected termcells : 1499
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.062 s
% 0.22/0.59 # System time : 0.006 s
% 0.22/0.59 # Total time : 0.067 s
% 0.22/0.59 # Maximum resident set size: 2648 pages
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.067 s
% 0.22/0.59 # System time : 0.009 s
% 0.22/0.59 # Total time : 0.076 s
% 0.22/0.59 # Maximum resident set size: 2016 pages
% 0.22/0.59 % E---3.1 exiting
% 0.22/0.60 % E exiting
%------------------------------------------------------------------------------