TSTP Solution File: LCL278-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL278-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:52 EDT 2024
% Result : Unsatisfiable 120.45s 15.68s
% Output : CNFRefutation 120.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of clauses : 89 ( 36 unt; 0 nHn; 43 RR)
% Number of literals : 161 ( 7 equ; 82 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; 3 con; 0-2 aty)
% Number of variables : 176 ( 24 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(equivalent(p,q),equivalent(or(p,r),or(q,r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
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_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_19,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_20,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,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_17,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_27,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_31,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_34,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_36,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_37,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_38,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_40,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_41,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_43,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_45,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_46,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_47,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_49,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_50,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_52,negated_conjecture,
~ theorem(implies(equivalent(p,q),equivalent(or(p,r),or(q,r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_53,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_54,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_55,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_48]) ).
cnf(c_0_56,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_57,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_49]) ).
cnf(c_0_58,plain,
( theorem(or(or(X1,X2),X3))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ theorem(implies(equivalent(p,q),equivalent(or(p,r),or(q,r)))),
c_0_52 ).
cnf(c_0_60,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_13]),c_0_13]),c_0_54]) ).
cnf(c_0_61,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_55]) ).
cnf(c_0_62,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_63,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_64,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_57,c_0_16]) ).
cnf(c_0_65,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_58,c_0_23]) ).
cnf(c_0_66,negated_conjecture,
~ theorem(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(or(p,r)),or(q,r))),not(or(not(or(q,r)),or(p,r))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_13]),c_0_60]),c_0_60]) ).
cnf(c_0_67,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_68,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_27,c_0_62]) ).
cnf(c_0_69,plain,
( theorem(X1)
| ~ theorem(or(X1,or(X1,X2)))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_56]) ).
cnf(c_0_70,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_64,c_0_22]) ).
cnf(c_0_71,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
~ theorem(or(not(or(not(or(not(or(p,r)),or(q,r))),not(or(not(or(q,r)),or(p,r))))),or(not(or(not(p),q)),not(or(not(q),p))))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X4)))
| ~ theorem(or(not(X2),X4))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_68]) ).
cnf(c_0_74,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_75,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_45,c_0_71]) ).
cnf(c_0_76,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_77,negated_conjecture,
( ~ theorem(or(not(not(or(not(or(q,r)),or(p,r)))),not(or(not(q),p))))
| ~ theorem(or(not(or(not(p),q)),or(not(or(p,r)),or(q,r)))) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
( theorem(or(X1,or(X2,or(X3,X4))))
| ~ theorem(or(X1,or(X3,or(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_80,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_76,c_0_75]) ).
cnf(c_0_81,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),or(not(or(p,r)),or(q,r))))
| ~ theorem(or(not(or(not(q),p)),or(not(or(q,r)),or(p,r)))) ),
inference(spm,[status(thm)],[c_0_77,c_0_67]) ).
cnf(c_0_82,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_68]) ).
cnf(c_0_83,plain,
theorem(or(not(X1),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),or(not(or(p,r)),or(q,r))))
| ~ theorem(or(or(not(or(q,r)),or(p,r)),q)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]) ).
cnf(c_0_85,negated_conjecture,
( ~ theorem(or(or(not(or(q,r)),or(p,r)),q))
| ~ theorem(or(or(not(or(p,r)),or(q,r)),p)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_82]),c_0_83])]) ).
cnf(c_0_86,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_62]) ).
cnf(c_0_87,negated_conjecture,
~ theorem(or(or(not(or(p,r)),or(q,r)),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_75])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_86]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL278-3 : TPTP v8.2.0. Released v2.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 02:00:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 120.45/15.68 # Version: 3.1.0
% 120.45/15.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 120.45/15.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 120.45/15.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 120.45/15.68 # Starting new_bool_3 with 300s (1) cores
% 120.45/15.68 # Starting new_bool_1 with 300s (1) cores
% 120.45/15.68 # Starting sh5l with 300s (1) cores
% 120.45/15.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7263 completed with status 0
% 120.45/15.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 120.45/15.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 120.45/15.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 120.45/15.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 120.45/15.68 # No SInE strategy applied
% 120.45/15.68 # Search class: FHUNM-FFSF21-DFFFFFNN
% 120.45/15.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 120.45/15.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 120.45/15.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 120.45/15.68 # Starting new_bool_3 with 296s (1) cores
% 120.45/15.68 # Starting new_bool_1 with 291s (1) cores
% 120.45/15.68 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 120.45/15.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7269 completed with status 0
% 120.45/15.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 120.45/15.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 120.45/15.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 120.45/15.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 120.45/15.68 # No SInE strategy applied
% 120.45/15.68 # Search class: FHUNM-FFSF21-DFFFFFNN
% 120.45/15.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 120.45/15.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 120.45/15.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 120.45/15.68 # Preprocessing time : 0.001 s
% 120.45/15.68 # Presaturation interreduction done
% 120.45/15.68
% 120.45/15.68 # Proof found!
% 120.45/15.68 # SZS status Unsatisfiable
% 120.45/15.68 # SZS output start CNFRefutation
% See solution above
% 120.45/15.68 # Parsed axioms : 11
% 120.45/15.68 # Removed by relevancy pruning/SinE : 0
% 120.45/15.68 # Initial clauses : 11
% 120.45/15.68 # Removed in clause preprocessing : 3
% 120.45/15.68 # Initial clauses in saturation : 8
% 120.45/15.68 # Processed clauses : 65650
% 120.45/15.68 # ...of these trivial : 281
% 120.45/15.68 # ...subsumed : 56123
% 120.45/15.68 # ...remaining for further processing : 9246
% 120.45/15.68 # Other redundant clauses eliminated : 0
% 120.45/15.68 # Clauses deleted for lack of memory : 0
% 120.45/15.68 # Backward-subsumed : 4442
% 120.45/15.68 # Backward-rewritten : 16
% 120.45/15.68 # Generated clauses : 829847
% 120.45/15.68 # ...of the previous two non-redundant : 815037
% 120.45/15.68 # ...aggressively subsumed : 0
% 120.45/15.68 # Contextual simplify-reflections : 66
% 120.45/15.68 # Paramodulations : 829847
% 120.45/15.68 # Factorizations : 0
% 120.45/15.68 # NegExts : 0
% 120.45/15.68 # Equation resolutions : 0
% 120.45/15.68 # Disequality decompositions : 0
% 120.45/15.68 # Total rewrite steps : 17325
% 120.45/15.68 # ...of those cached : 15275
% 120.45/15.68 # Propositional unsat checks : 1
% 120.45/15.68 # Propositional check models : 0
% 120.45/15.68 # Propositional check unsatisfiable : 0
% 120.45/15.68 # Propositional clauses : 0
% 120.45/15.68 # Propositional clauses after purity: 0
% 120.45/15.68 # Propositional unsat core size : 0
% 120.45/15.68 # Propositional preprocessing time : 0.000
% 120.45/15.68 # Propositional encoding time : 0.502
% 120.45/15.68 # Propositional solver time : 0.116
% 120.45/15.68 # Success case prop preproc time : 0.000
% 120.45/15.68 # Success case prop encoding time : 0.000
% 120.45/15.68 # Success case prop solver time : 0.000
% 120.45/15.68 # Current number of processed clauses : 4780
% 120.45/15.68 # Positive orientable unit clauses : 180
% 120.45/15.68 # Positive unorientable unit clauses: 0
% 120.45/15.68 # Negative unit clauses : 229
% 120.45/15.68 # Non-unit-clauses : 4371
% 120.45/15.68 # Current number of unprocessed clauses: 745206
% 120.45/15.68 # ...number of literals in the above : 2189832
% 120.45/15.68 # Current number of archived formulas : 0
% 120.45/15.68 # Current number of archived clauses : 4469
% 120.45/15.68 # Clause-clause subsumption calls (NU) : 6450744
% 120.45/15.68 # Rec. Clause-clause subsumption calls : 5602678
% 120.45/15.68 # Non-unit clause-clause subsumptions : 39886
% 120.45/15.68 # Unit Clause-clause subsumption calls : 143702
% 120.45/15.68 # Rewrite failures with RHS unbound : 0
% 120.45/15.68 # BW rewrite match attempts : 25224
% 120.45/15.68 # BW rewrite match successes : 16
% 120.45/15.68 # Condensation attempts : 0
% 120.45/15.68 # Condensation successes : 0
% 120.45/15.68 # Termbank termtop insertions : 19221722
% 120.45/15.68 # Search garbage collected termcells : 11
% 120.45/15.68
% 120.45/15.68 # -------------------------------------------------
% 120.45/15.68 # User time : 14.502 s
% 120.45/15.68 # System time : 0.425 s
% 120.45/15.68 # Total time : 14.928 s
% 120.45/15.68 # Maximum resident set size: 1692 pages
% 120.45/15.68
% 120.45/15.68 # -------------------------------------------------
% 120.45/15.68 # User time : 73.418 s
% 120.45/15.68 # System time : 1.277 s
% 120.45/15.68 # Total time : 74.696 s
% 120.45/15.68 # Maximum resident set size: 1712 pages
% 120.45/15.68 % E---3.1 exiting
% 120.45/15.68 % E exiting
%------------------------------------------------------------------------------