%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : REL007-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:04:15 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.83s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 9
% Syntax : Number of clauses : 85 ( 85 unt; 0 nHn; 19 RR)
% Number of literals : 85 ( 84 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
meet(sk1,converse(sk2)) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(goals_15,negated_conjecture,
meet(converse(sk1),sk2) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_9,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_10,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_11,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_13,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_14,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_12]),c_0_10]) ).
cnf(c_0_15,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_16,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_14]),c_0_12]),c_0_17]) ).
cnf(c_0_19,plain,
meet(complement(X1),X2) = complement(join(X1,complement(X2))),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_20,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_21,plain,
join(zero,meet(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_10]) ).
cnf(c_0_22,plain,
complement(join(X1,complement(X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_18]) ).
cnf(c_0_23,plain,
join(zero,join(meet(X1,X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
join(X1,complement(X1)) = complement(zero),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_25,plain,
join(X1,complement(meet(X1,X1))) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_26,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_27,plain,
join(X1,complement(zero)) = complement(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_18]),c_0_18]),c_0_26]),c_0_12]),c_0_24]) ).
cnf(c_0_28,plain,
join(meet(X1,X2),complement(join(complement(X2),X1))) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_20]) ).
cnf(c_0_30,plain,
meet(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_27]),c_0_18]) ).
cnf(c_0_31,plain,
join(zero,complement(join(zero,complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_19]),c_0_18]),c_0_12]) ).
cnf(c_0_32,plain,
join(zero,complement(join(X1,X1))) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_18]),c_0_18]) ).
cnf(c_0_33,plain,
join(zero,join(X1,meet(X2,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_34,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_35,plain,
join(zero,X1) = join(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18]) ).
cnf(c_0_36,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]) ).
cnf(c_0_37,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_37]),c_0_20]),c_0_37]) ).
cnf(c_0_39,plain,
join(meet(X1,X2),meet(X2,complement(X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_40,negated_conjecture,
meet(sk1,converse(sk2)) = zero,
goals_14 ).
cnf(c_0_41,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_12]) ).
cnf(c_0_42,negated_conjecture,
join(zero,complement(join(complement(sk1),converse(sk2)))) = sk1,
inference(spm,[status(thm)],[c_0_11,c_0_40]) ).
cnf(c_0_43,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_44,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_45,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_46,negated_conjecture,
complement(join(complement(sk1),converse(sk2))) = sk1,
inference(rw,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_47,plain,
join(meet(X1,X2),complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_48,plain,
meet(X1,complement(X2)) = complement(join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_43]),c_0_18]),c_0_18]) ).
cnf(c_0_50,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
join(complement(sk1),converse(sk2)) = complement(sk1),
inference(spm,[status(thm)],[c_0_18,c_0_46]) ).
cnf(c_0_52,plain,
join(meet(X1,X2),complement(join(X1,complement(X2)))) = X2,
inference(spm,[status(thm)],[c_0_47,c_0_14]) ).
cnf(c_0_53,plain,
join(X1,complement(join(X1,join(complement(X1),X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_43]),c_0_18]),c_0_18]),c_0_48]),c_0_26]),c_0_12]) ).
cnf(c_0_54,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_12]) ).
cnf(c_0_55,negated_conjecture,
join(sk2,converse(complement(sk1))) = converse(complement(sk1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_12]) ).
cnf(c_0_56,plain,
join(X1,join(complement(X1),X2)) = complement(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_24]) ).
cnf(c_0_57,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_58,plain,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_59,negated_conjecture,
meet(sk2,converse(complement(sk1))) = sk2,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_61,plain,
join(X1,join(X2,complement(X1))) = complement(zero),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
join(complement(sk2),complement(converse(complement(sk1)))) = complement(sk2),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
join(complement(zero),X1) = complement(zero),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_64,plain,
join(X1,converse(complement(zero))) = converse(complement(zero)),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_65,negated_conjecture,
join(complement(sk2),converse(complement(sk1))) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_12]) ).
cnf(c_0_66,plain,
converse(complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
join(complement(sk1),converse(complement(sk2))) = complement(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_65]),c_0_66]),c_0_12]) ).
cnf(c_0_68,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_69,plain,
join(X1,converse(meet(X2,converse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_45]) ).
cnf(c_0_70,negated_conjecture,
meet(sk1,converse(complement(sk2))) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_67]),c_0_18]),c_0_68]) ).
cnf(c_0_71,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_72,negated_conjecture,
join(complement(sk2),converse(sk1)) = complement(sk2),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
meet(X1,join(X2,join(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_54,c_0_26]) ).
cnf(c_0_74,negated_conjecture,
join(sk2,complement(converse(sk1))) = complement(converse(sk1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_18]),c_0_12]) ).
cnf(c_0_75,plain,
meet(X1,join(complement(X2),complement(X3))) = complement(join(complement(X1),meet(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_76,negated_conjecture,
meet(sk2,join(X1,complement(converse(sk1)))) = sk2,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
meet(converse(sk1),sk2) != zero,
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_78,plain,
meet(meet(X1,X2),join(complement(X1),complement(X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_14]) ).
cnf(c_0_79,negated_conjecture,
complement(join(complement(sk2),meet(X1,converse(sk1)))) = sk2,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
meet(converse(sk1),sk2) != zero,
c_0_77 ).
cnf(c_0_81,plain,
complement(join(complement(X1),join(complement(X2),meet(X2,X1)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_75]),c_0_12]),c_0_58]),c_0_26]),c_0_12]) ).
cnf(c_0_82,negated_conjecture,
join(complement(sk2),meet(X1,converse(sk1))) = complement(sk2),
inference(spm,[status(thm)],[c_0_18,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
meet(sk2,converse(sk1)) != zero,
inference(rw,[status(thm)],[c_0_80,c_0_14]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_10]),c_0_14]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL007-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.70 % Computer : n007.cluster.edu
% 0.20/0.70 % Model : x86_64 x86_64
% 0.20/0.70 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.70 % Memory : 8046.5625MB
% 0.20/0.70 % OS : Linux 6.8.0-71-generic
% 0.20/0.70 % CPULimit : 300
% 0.25/0.70 % WCLimit : 300
% 0.25/0.70 % DateTime : Mon Sep 21 03:55:51 UTC 2026
% 0.25/0.70 % CPUTime :
% 0.25/0.70 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.76 Running first-order theorem proving
% 0.25/0.76 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
% 0.25/0.83 % Version: 3.5.1
% 0.25/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.83 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.83 % Starting sh5l with 300s (1) cores
% 0.25/0.83 % new_bool_3 with pid 122158 completed with status 0
% 0.25/0.83 % Result found by new_bool_3
% 0.25/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.83 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.25/0.83 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.83 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.83 % SubtermCWHack with pid 122161 completed with status 0
% 0.25/0.83 % Result found by SubtermCWHack
% 0.25/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.83 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.25/0.83 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.83 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.83 % Preprocessing time : 0.001 s
% 0.25/0.83
% 0.25/0.83 % Proof found!
% 0.25/0.83 % SZS status Unsatisfiable
% 0.25/0.83 % SZS output start CNFRefutation
% See solution above
% 0.25/0.83 % Parsed axioms : 15
% 0.25/0.83 % Removed by relevancy pruning/SinE : 2
% 0.25/0.83 % Initial clauses : 13
% 0.25/0.83 % Removed in clause preprocessing : 0
% 0.25/0.83 % Initial clauses in saturation : 13
% 0.25/0.83 % Processed clauses : 508
% 0.25/0.83 % ...of these trivial : 238
% 0.25/0.83 % ...subsumed : 105
% 0.25/0.83 % ...remaining for further processing : 165
% 0.25/0.83 % Other redundant clauses eliminated : 0
% 0.25/0.83 % Clauses deleted for lack of memory : 0
% 0.25/0.83 % Backward-subsumed : 0
% 0.25/0.83 % Backward-rewritten : 44
% 0.25/0.83 % Generated clauses : 4766
% 0.25/0.83 % ...of the previous two non-redundant : 2924
% 0.25/0.83 % ...aggressively subsumed : 0
% 0.25/0.83 % Contextual simplify-reflections : 0
% 0.25/0.83 % Paramodulations : 4766
% 0.25/0.83 % Factorizations : 0
% 0.25/0.83 % NegExts : 0
% 0.25/0.83 % Equation resolutions : 0
% 0.25/0.83 % Disequality decompositions : 0
% 0.25/0.83 % Total rewrite steps : 6020
% 0.25/0.83 % ...of those cached : 4357
% 0.25/0.83 % Propositional unsat checks : 0
% 0.25/0.83 % Propositional check models : 0
% 0.25/0.83 % Propositional check unsatisfiable : 0
% 0.25/0.83 % Propositional clauses : 0
% 0.25/0.83 % Propositional clauses after purity: 0
% 0.25/0.83 % Propositional unsat core size : 0
% 0.25/0.83 % Propositional preprocessing time : 0.000
% 0.25/0.83 % Propositional encoding time : 0.000
% 0.25/0.83 % Propositional solver time : 0.000
% 0.25/0.83 % Success case prop preproc time : 0.000
% 0.25/0.83 % Success case prop encoding time : 0.000
% 0.25/0.83 % Success case prop solver time : 0.000
% 0.25/0.83 % Current number of processed clauses : 121
% 0.25/0.83 % Positive orientable unit clauses : 115
% 0.25/0.83 % Positive unorientable unit clauses: 5
% 0.25/0.83 % Negative unit clauses : 1
% 0.25/0.83 % Non-unit-clauses : 0
% 0.25/0.83 % Current number of unprocessed clauses: 2316
% 0.25/0.83 % ...number of literals in the above : 2316
% 0.25/0.83 % Current number of archived formulas : 0
% 0.25/0.83 % Current number of archived clauses : 44
% 0.25/0.83 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.83 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.83 % Non-unit clause-clause subsumptions : 0
% 0.25/0.83 % Unit Clause-clause subsumption calls : 20
% 0.25/0.83 % Rewrite failures with RHS unbound : 0
% 0.25/0.83 % BW rewrite match attempts : 374
% 0.25/0.83 % BW rewrite match successes : 78
% 0.25/0.83 % Condensation attempts : 0
% 0.25/0.83 % Condensation successes : 0
% 0.25/0.83 % Termbank termtop insertions : 45938
% 0.25/0.83 % Search garbage collected termcells : 8
% 0.25/0.83
% 0.25/0.83 % -------------------------------------------------
% 0.25/0.83 % User time : 0.036 s
% 0.25/0.83 % System time : 0.008 s
% 0.25/0.83 % Total time : 0.044 s
% 0.25/0.83 % Maximum resident set size: 3644 pages
% 0.25/0.83
% 0.25/0.83 % -------------------------------------------------
% 0.25/0.83 % User time : 0.036 s
% 0.25/0.83 % System time : 0.013 s
% 0.25/0.83 % Total time : 0.049 s
% 0.25/0.83 % Maximum resident set size: 4864 pages
% 0.25/0.83 % E exiting
%------------------------------------------------------------------------------