TSTP Solution File: LCL255-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL255-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Mon May 20 23:45:47 EDT 2024
% Result : Unsatisfiable 213.90s 27.55s
% Output : CNFRefutation 213.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 10
% Syntax : Number of clauses : 102 ( 38 unt; 0 nHn; 54 RR)
% Number of literals : 188 ( 4 equ; 98 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 208 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(and(implies(p,r),implies(q,s)),implies(or(p,q),or(r,s)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_10 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_18,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_19,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_27,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_30,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_35,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_36,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_37,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_38,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_39,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_40,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_41,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_42,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_43,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_44,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_46,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_47,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_30]) ).
cnf(c_0_48,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_50,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_51,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_46,c_0_15]) ).
cnf(c_0_53,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_49]) ).
cnf(c_0_54,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_55,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_50]) ).
cnf(c_0_56,plain,
( theorem(or(or(X1,X2),X3))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ theorem(implies(and(implies(p,r),implies(q,s)),implies(or(p,q),or(r,s)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_58,plain,
( theorem(X1)
| ~ theorem(or(X1,X2))
| ~ theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_53]) ).
cnf(c_0_59,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_49]) ).
cnf(c_0_60,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_54]) ).
cnf(c_0_61,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_15]) ).
cnf(c_0_62,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_63,negated_conjecture,
~ theorem(implies(and(implies(p,r),implies(q,s)),implies(or(p,q),or(r,s)))),
c_0_57 ).
cnf(c_0_64,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_65,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(or(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_66,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_50]) ).
cnf(c_0_67,plain,
( theorem(X1)
| ~ theorem(not(X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_32]) ).
cnf(c_0_68,plain,
( theorem(not(not(X1)))
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_15]) ).
cnf(c_0_69,plain,
( theorem(X1)
| ~ theorem(or(X1,or(X1,X2)))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_60,c_0_54]) ).
cnf(c_0_70,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_71,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_62]) ).
cnf(c_0_72,negated_conjecture,
~ theorem(or(not(not(or(not(or(not(p),r)),not(or(not(q),s))))),or(not(or(p,q)),or(r,s)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_12]),c_0_12]),c_0_12]),c_0_12]),c_0_64]) ).
cnf(c_0_73,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_67,c_0_21]) ).
cnf(c_0_75,plain,
( theorem(not(not(or(X1,or(X2,X3)))))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_68,c_0_41]) ).
cnf(c_0_76,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_46,c_0_71]) ).
cnf(c_0_78,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_23]) ).
cnf(c_0_79,negated_conjecture,
~ theorem(or(or(not(or(not(p),r)),not(or(not(q),s))),or(not(or(p,q)),or(r,s)))),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_80,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_81,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_78]) ).
cnf(c_0_83,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_84,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(or(not(or(p,q)),or(r,s)),not(or(not(q),s))))),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,plain,
( theorem(or(X1,or(X2,or(X3,X4))))
| ~ theorem(or(X1,or(X3,or(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_87,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_83,c_0_77]) ).
cnf(c_0_88,negated_conjecture,
( ~ theorem(or(not(r),or(or(not(or(p,q)),or(r,s)),not(or(not(q),s)))))
| ~ theorem(or(or(or(not(or(p,q)),or(r,s)),not(or(not(q),s))),p)) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_83,c_0_50]) ).
cnf(c_0_90,plain,
theorem(or(not(X1),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,negated_conjecture,
~ theorem(or(or(or(not(or(p,q)),or(r,s)),not(or(not(q),s))),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_92,negated_conjecture,
~ theorem(or(or(not(or(p,q)),or(r,s)),or(p,not(or(not(q),s))))),
inference(spm,[status(thm)],[c_0_91,c_0_80]) ).
cnf(c_0_93,plain,
( theorem(or(X1,or(or(X2,X3),X4)))
| ~ theorem(or(or(X1,X4),X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_66]) ).
cnf(c_0_94,negated_conjecture,
~ theorem(or(not(or(p,q)),or(or(p,not(or(not(q),s))),or(r,s)))),
inference(spm,[status(thm)],[c_0_92,c_0_80]) ).
cnf(c_0_95,plain,
( theorem(or(X1,or(X2,or(X3,X4))))
| ~ theorem(or(or(X1,X2),X4)) ),
inference(spm,[status(thm)],[c_0_83,c_0_93]) ).
cnf(c_0_96,plain,
( theorem(or(X1,or(not(or(X2,X3)),or(X2,X4))))
| ~ theorem(or(X1,or(not(X3),X4))) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_97,negated_conjecture,
~ theorem(or(or(not(or(p,q)),or(p,not(or(not(q),s)))),s)),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,plain,
( theorem(or(or(not(or(X1,X2)),or(X1,X3)),X4))
| ~ theorem(or(X4,or(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_96]) ).
cnf(c_0_99,negated_conjecture,
~ theorem(or(s,or(not(q),not(or(not(q),s))))),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_100,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X3,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_83,c_0_52]) ).
cnf(c_0_101,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL255-3 : TPTP v8.2.0. Released v2.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 02:28:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 213.90/27.55 # Version: 3.1.0
% 213.90/27.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 213.90/27.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.90/27.55 # Starting new_bool_3 with 300s (1) cores
% 213.90/27.55 # Starting new_bool_1 with 300s (1) cores
% 213.90/27.55 # Starting sh5l with 300s (1) cores
% 213.90/27.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27912 completed with status 0
% 213.90/27.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 213.90/27.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 213.90/27.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.90/27.55 # No SInE strategy applied
% 213.90/27.55 # Search class: FHUNM-FFSF21-DFFFFFNN
% 213.90/27.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 213.90/27.55 # Starting new_bool_3 with 329s (1) cores
% 213.90/27.55 # Starting new_bool_1 with 324s (1) cores
% 213.90/27.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 213.90/27.55 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27923 completed with status 0
% 213.90/27.55 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 213.90/27.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 213.90/27.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.90/27.55 # No SInE strategy applied
% 213.90/27.55 # Search class: FHUNM-FFSF21-DFFFFFNN
% 213.90/27.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 213.90/27.55 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 213.90/27.55 # Starting new_bool_3 with 329s (1) cores
% 213.90/27.55 # Starting new_bool_1 with 324s (1) cores
% 213.90/27.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 213.90/27.55 # Preprocessing time : 0.002 s
% 213.90/27.55 # Presaturation interreduction done
% 213.90/27.55
% 213.90/27.55 # Proof found!
% 213.90/27.55 # SZS status Unsatisfiable
% 213.90/27.55 # SZS output start CNFRefutation
% See solution above
% 213.90/27.55 # Parsed axioms : 10
% 213.90/27.55 # Removed by relevancy pruning/SinE : 0
% 213.90/27.55 # Initial clauses : 10
% 213.90/27.55 # Removed in clause preprocessing : 2
% 213.90/27.55 # Initial clauses in saturation : 8
% 213.90/27.55 # Processed clauses : 98640
% 213.90/27.55 # ...of these trivial : 391
% 213.90/27.55 # ...subsumed : 88897
% 213.90/27.55 # ...remaining for further processing : 9352
% 213.90/27.55 # Other redundant clauses eliminated : 0
% 213.90/27.55 # Clauses deleted for lack of memory : 0
% 213.90/27.55 # Backward-subsumed : 931
% 213.90/27.55 # Backward-rewritten : 20
% 213.90/27.55 # Generated clauses : 1567938
% 213.90/27.55 # ...of the previous two non-redundant : 1542517
% 213.90/27.55 # ...aggressively subsumed : 0
% 213.90/27.55 # Contextual simplify-reflections : 3
% 213.90/27.55 # Paramodulations : 1567938
% 213.90/27.55 # Factorizations : 0
% 213.90/27.55 # NegExts : 0
% 213.90/27.55 # Equation resolutions : 0
% 213.90/27.55 # Disequality decompositions : 0
% 213.90/27.55 # Total rewrite steps : 26524
% 213.90/27.55 # ...of those cached : 23567
% 213.90/27.55 # Propositional unsat checks : 1
% 213.90/27.55 # Propositional check models : 0
% 213.90/27.55 # Propositional check unsatisfiable : 0
% 213.90/27.55 # Propositional clauses : 0
% 213.90/27.55 # Propositional clauses after purity: 0
% 213.90/27.55 # Propositional unsat core size : 0
% 213.90/27.55 # Propositional preprocessing time : 0.000
% 213.90/27.55 # Propositional encoding time : 1.032
% 213.90/27.55 # Propositional solver time : 0.208
% 213.90/27.55 # Success case prop preproc time : 0.000
% 213.90/27.55 # Success case prop encoding time : 0.000
% 213.90/27.55 # Success case prop solver time : 0.000
% 213.90/27.55 # Current number of processed clauses : 8393
% 213.90/27.55 # Positive orientable unit clauses : 220
% 213.90/27.55 # Positive unorientable unit clauses: 0
% 213.90/27.55 # Negative unit clauses : 1177
% 213.90/27.55 # Non-unit-clauses : 6996
% 213.90/27.55 # Current number of unprocessed clauses: 1440372
% 213.90/27.55 # ...number of literals in the above : 4115504
% 213.90/27.55 # Current number of archived formulas : 0
% 213.90/27.55 # Current number of archived clauses : 961
% 213.90/27.55 # Clause-clause subsumption calls (NU) : 8108947
% 213.90/27.55 # Rec. Clause-clause subsumption calls : 7397320
% 213.90/27.55 # Non-unit clause-clause subsumptions : 80962
% 213.90/27.55 # Unit Clause-clause subsumption calls : 220042
% 213.90/27.55 # Rewrite failures with RHS unbound : 0
% 213.90/27.55 # BW rewrite match attempts : 42275
% 213.90/27.55 # BW rewrite match successes : 20
% 213.90/27.55 # Condensation attempts : 0
% 213.90/27.55 # Condensation successes : 0
% 213.90/27.55 # Termbank termtop insertions : 37194258
% 213.90/27.55 # Search garbage collected termcells : 11
% 213.90/27.55
% 213.90/27.55 # -------------------------------------------------
% 213.90/27.55 # User time : 25.766 s
% 213.90/27.55 # System time : 0.817 s
% 213.90/27.55 # Total time : 26.583 s
% 213.90/27.55 # Maximum resident set size: 1688 pages
% 213.90/27.55
% 213.90/27.55 # -------------------------------------------------
% 213.90/27.55 # User time : 131.202 s
% 213.90/27.55 # System time : 2.254 s
% 213.90/27.55 # Total time : 133.457 s
% 213.90/27.55 # Maximum resident set size: 1708 pages
% 213.90/27.55 % E---3.1 exiting
% 213.90/27.55 % E exiting
%------------------------------------------------------------------------------