TSTP Solution File: LCL060-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL060-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 18:23:36 EDT 2023
% Result : Unsatisfiable 298.01s 40.72s
% Output : CNFRefutation 298.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 6
% Syntax : Number of clauses : 75 ( 75 unt; 0 nHn; 3 RR)
% Number of literals : 75 ( 74 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 206 ( 53 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',cn_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',ifeq_axiom) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)) = true,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',cn_3) ).
cnf(prove_cn_54,negated_conjecture,
is_a_theorem(implies(implies(a,b),implies(implies(not(a),b),b))) != true,
file('/export/starexec/sandbox2/tmp/tmp.KkquNLtUCN/E---3.1_25882.p',prove_cn_54) ).
cnf(c_0_6,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
cn_1 ).
cnf(c_0_8,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)) = true,
cn_2 ).
cnf(c_0_10,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X2,X3),implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
cn_3 ).
cnf(c_0_12,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),X1),X1),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_8]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(not(X1),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_8]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8]) ).
cnf(c_0_16,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(not(X1),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_8]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(implies(not(X1),X2),X3)),true,is_a_theorem(implies(X1,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_8]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(implies(X3,X3)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_8]) ).
cnf(c_0_21,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(not(X1),X2),X3),implies(X1,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_8]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(not(X3),X2)),X4),implies(X3,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_8]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_8]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_8]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_8]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(not(implies(X1,X1)),X2),X3),implies(X4,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_8]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_25]),c_0_8]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_26]),c_0_8]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_8]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_8]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(not(X2),X3)),X4)),true,is_a_theorem(implies(X2,X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_28]),c_0_8]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_8]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_31]),c_0_8]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_8]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(implies(implies(X1,X1),X2)),true,is_a_theorem(implies(X3,X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_34]),c_0_8]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(X1,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_35]),c_0_8]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_8]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X4,X4),X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_34]),c_0_8]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_8]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_38]),c_0_8]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_39]),c_0_8]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(not(X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_40]),c_0_8]) ).
cnf(c_0_44,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_41]),c_0_8]) ).
cnf(c_0_45,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(X1,X1),X2),X2),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_42]),c_0_8]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X4),implies(implies(implies(implies(not(X1),X1),X2),X3),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_8]) ).
cnf(c_0_47,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(X2,X3)),X4)),true,is_a_theorem(implies(not(X1),X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_43]),c_0_8]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_8]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_8]) ).
cnf(c_0_50,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X2)),X4)),true,is_a_theorem(implies(implies(X3,X1),X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_30]),c_0_8]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_8]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_8]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_49]),c_0_8]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_8]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(not(X2),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_52]),c_0_8]) ).
cnf(c_0_56,plain,
ifeq(is_a_theorem(implies(implies(X1,X2),X3)),true,is_a_theorem(implies(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_53]),c_0_8]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_54]),c_0_8]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_55]),c_0_8]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_8]) ).
cnf(c_0_60,plain,
ifeq(is_a_theorem(implies(implies(not(X1),implies(X1,X2)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_58]),c_0_8]) ).
cnf(c_0_61,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_59]),c_0_8]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_57]),c_0_8]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),X1),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_8]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_59]),c_0_8]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X2)),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_8]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_64]),c_0_8]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_65]),c_0_8]) ).
cnf(c_0_68,plain,
ifeq(is_a_theorem(implies(X1,implies(X2,X3))),true,is_a_theorem(implies(X2,implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_66]),c_0_8]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_67]),c_0_8]) ).
cnf(c_0_70,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),X1),X2),X3)),true,is_a_theorem(implies(implies(X1,X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_26]),c_0_8]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X1,X3),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_8]) ).
cnf(c_0_72,negated_conjecture,
is_a_theorem(implies(implies(a,b),implies(implies(not(a),b),b))) != true,
prove_cn_54 ).
cnf(c_0_73,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_8]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : LCL060-10 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 12:28:44 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.KkquNLtUCN/E---3.1_25882.p
% 298.01/40.72 # Version: 3.1pre001
% 298.01/40.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 298.01/40.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.01/40.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 298.01/40.72 # Starting new_bool_3 with 300s (1) cores
% 298.01/40.72 # Starting new_bool_1 with 300s (1) cores
% 298.01/40.72 # Starting sh5l with 300s (1) cores
% 298.01/40.72 # new_bool_3 with pid 25983 completed with status 8
% 298.01/40.72 # new_bool_1 with pid 25987 completed with status 8
% 298.01/40.72 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25982 completed with status 0
% 298.01/40.72 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 298.01/40.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 298.01/40.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.01/40.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 298.01/40.72 # No SInE strategy applied
% 298.01/40.72 # Search class: FUUPM-FFSF32-MFFFFFNN
% 298.01/40.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 298.01/40.72 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 298.01/40.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 298.01/40.72 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 298.01/40.72 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 298.01/40.72 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 298.01/40.72 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25995 completed with status 0
% 298.01/40.72 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 298.01/40.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 298.01/40.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.01/40.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 298.01/40.72 # No SInE strategy applied
% 298.01/40.72 # Search class: FUUPM-FFSF32-MFFFFFNN
% 298.01/40.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 298.01/40.72 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 298.01/40.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 298.01/40.72 # Preprocessing time : 0.004 s
% 298.01/40.72
% 298.01/40.72 # Proof found!
% 298.01/40.72 # SZS status Unsatisfiable
% 298.01/40.72 # SZS output start CNFRefutation
% See solution above
% 298.01/40.72 # Parsed axioms : 6
% 298.01/40.72 # Removed by relevancy pruning/SinE : 0
% 298.01/40.72 # Initial clauses : 6
% 298.01/40.72 # Removed in clause preprocessing : 0
% 298.01/40.72 # Initial clauses in saturation : 6
% 298.01/40.72 # Processed clauses : 10809
% 298.01/40.72 # ...of these trivial : 6496
% 298.01/40.72 # ...subsumed : 0
% 298.01/40.72 # ...remaining for further processing : 4313
% 298.01/40.72 # Other redundant clauses eliminated : 0
% 298.01/40.72 # Clauses deleted for lack of memory : 0
% 298.01/40.72 # Backward-subsumed : 0
% 298.01/40.72 # Backward-rewritten : 121
% 298.01/40.72 # Generated clauses : 2341799
% 298.01/40.72 # ...of the previous two non-redundant : 511190
% 298.01/40.72 # ...aggressively subsumed : 0
% 298.01/40.72 # Contextual simplify-reflections : 0
% 298.01/40.72 # Paramodulations : 2341799
% 298.01/40.72 # Factorizations : 0
% 298.01/40.72 # NegExts : 0
% 298.01/40.72 # Equation resolutions : 0
% 298.01/40.72 # Total rewrite steps : 2663682
% 298.01/40.72 # Propositional unsat checks : 0
% 298.01/40.72 # Propositional check models : 0
% 298.01/40.72 # Propositional check unsatisfiable : 0
% 298.01/40.72 # Propositional clauses : 0
% 298.01/40.72 # Propositional clauses after purity: 0
% 298.01/40.72 # Propositional unsat core size : 0
% 298.01/40.72 # Propositional preprocessing time : 0.000
% 298.01/40.72 # Propositional encoding time : 0.000
% 298.01/40.72 # Propositional solver time : 0.000
% 298.01/40.72 # Success case prop preproc time : 0.000
% 298.01/40.72 # Success case prop encoding time : 0.000
% 298.01/40.72 # Success case prop solver time : 0.000
% 298.01/40.72 # Current number of processed clauses : 4192
% 298.01/40.72 # Positive orientable unit clauses : 4192
% 298.01/40.72 # Positive unorientable unit clauses: 0
% 298.01/40.72 # Negative unit clauses : 0
% 298.01/40.72 # Non-unit-clauses : 0
% 298.01/40.72 # Current number of unprocessed clauses: 500005
% 298.01/40.72 # ...number of literals in the above : 500005
% 298.01/40.72 # Current number of archived formulas : 0
% 298.01/40.72 # Current number of archived clauses : 121
% 298.01/40.72 # Clause-clause subsumption calls (NU) : 0
% 298.01/40.72 # Rec. Clause-clause subsumption calls : 0
% 298.01/40.72 # Non-unit clause-clause subsumptions : 0
% 298.01/40.72 # Unit Clause-clause subsumption calls : 0
% 298.01/40.72 # Rewrite failures with RHS unbound : 0
% 298.01/40.72 # BW rewrite match attempts : 1850977
% 298.01/40.72 # BW rewrite match successes : 120
% 298.01/40.72 # Condensation attempts : 0
% 298.01/40.72 # Condensation successes : 0
% 298.01/40.72 # Termbank termtop insertions : 58254501
% 298.01/40.72
% 298.01/40.72 # -------------------------------------------------
% 298.01/40.72 # User time : 38.737 s
% 298.01/40.72 # System time : 0.930 s
% 298.01/40.72 # Total time : 39.666 s
% 298.01/40.72 # Maximum resident set size: 1508 pages
% 298.01/40.72
% 298.01/40.72 # -------------------------------------------------
% 298.01/40.72 # User time : 254.522 s
% 298.01/40.72 # System time : 4.214 s
% 298.01/40.72 # Total time : 258.736 s
% 298.01/40.72 # Maximum resident set size: 1672 pages
% 298.01/40.72 % E---3.1 exiting
%------------------------------------------------------------------------------