%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWC002-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 12:45:52 PM UTC 2026
% Result : Unsatisfiable 31.63s 5.15s
% Output : CNFRefutation 31.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 30 RR)
% Number of literals : 63 ( 57 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 79 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_table_definition,axiom,
and(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(and(X1,X5),and(X2,X6),and(X3,X7),and(X4,X8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_table_definition) ).
cnf(and_definition5,axiom,
and(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_definition5) ).
cnf(full_table,axiom,
table(n1,n1,n1,n1) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',full_table) ).
cnf(empty_table,axiom,
table(n0,n0,n0,n0) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_table) ).
cnf(and_definition4,axiom,
and(n1,n1) = n1,
file('/export/starexec/sandbox/benchmark/Axioms/HWC001-0.ax',and_definition4) ).
cnf(and_definition2,axiom,
and(n0,n1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWC001-0.ax',and_definition2) ).
cnf(not_table_definition,axiom,
not(table(X1,X2,X3,X4)) = table(not(X1),not(X2),not(X3),not(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_table_definition) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWC001-0.ax',not_definition2) ).
cnf(and_definition1,axiom,
and(n0,n0) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWC001-0.ax',and_definition1) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/benchmark/Axioms/HWC001-0.ax',not_definition1) ).
cnf(not_definition3,axiom,
not(nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_definition3) ).
cnf(prove_output_configuration,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_output_configuration) ).
cnf(connect_definition1,axiom,
connect(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connect_definition1) ).
cnf(subsume_symmetric,axiom,
circuit(top(X1),X2,bottom(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsume_symmetric) ).
cnf(c_0_14,axiom,
and(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(and(X1,X5),and(X2,X6),and(X3,X7),and(X4,X8)),
and_table_definition ).
cnf(c_0_15,axiom,
and(nil,X1) = X1,
and_definition5 ).
cnf(c_0_16,plain,
table(and(X1,X2),and(X3,X4),and(X5,X6),X7) = and(table(X1,X3,X5,nil),table(X2,X4,X6,X7)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
and(table(X1,X2,nil,nil),table(X3,X4,X5,X6)) = table(and(X1,X3),and(X2,X4),X5,X6),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,axiom,
table(n1,n1,n1,n1) = nil,
full_table ).
cnf(c_0_19,plain,
table(and(X1,n1),and(X2,n1),n1,n1) = and(table(X1,X2,nil,nil),nil),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
table(n0,n0,n0,n0) = nil,
empty_table ).
cnf(c_0_21,axiom,
and(n1,n1) = n1,
and_definition4 ).
cnf(c_0_22,plain,
table(and(X1,n1),n1,n1,n1) = and(table(X1,nil,nil,nil),nil),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,axiom,
and(n0,n1) = n0,
and_definition2 ).
cnf(c_0_24,axiom,
not(table(X1,X2,X3,X4)) = table(not(X1),not(X2),not(X3),not(X4)),
not_table_definition ).
cnf(c_0_25,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_26,plain,
table(and(X1,n0),and(X2,n0),n0,n0) = and(table(X1,X2,nil,nil),nil),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_27,plain,
and(table(X1,nil,nil,nil),nil) = and(table(X1,n1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
and(table(n0,nil,nil,nil),nil) = table(n0,n1,n1,n1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
table(not(X1),not(X2),not(X3),n0) = not(table(X1,X2,X3,n1)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
table(and(X1,n1),n0,n1,n1) = and(table(X1,n0,nil,nil),nil),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_31,axiom,
and(n0,n0) = n0,
and_definition1 ).
cnf(c_0_32,plain,
table(and(X1,n0),n0,n0,n0) = and(table(X1,n1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_33,plain,
and(table(n0,n1,nil,nil),nil) = table(n0,n1,n1,n1),
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,plain,
table(not(X1),not(X2),n0,n0) = not(table(X1,X2,n1,n1)),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_35,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_36,plain,
and(table(n0,n0,nil,nil),nil) = table(n0,n0,n1,n1),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_37,plain,
and(table(X1,n0,nil,nil),nil) = and(table(X1,n1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_32]) ).
cnf(c_0_38,plain,
table(n0,n1,n1,n1) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_20]),c_0_33]) ).
cnf(c_0_39,plain,
not(table(X1,n0,n1,n1)) = table(not(X1),n1,n0,n0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
table(n0,n0,n1,n1) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_33]),c_0_38]) ).
cnf(c_0_41,axiom,
not(nil) = nil,
not_definition3 ).
cnf(c_0_42,plain,
and(table(X1,nil,X2,nil),table(X3,X4,X5,X6)) = table(and(X1,X3),X4,and(X2,X5),X6),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_43,plain,
table(n1,n1,n0,n0) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_35]) ).
cnf(c_0_44,plain,
table(n1,and(X1,n1),n1,n1) = and(table(nil,X1,nil,nil),nil),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_45,plain,
table(and(X1,n1),n1,and(X2,n1),n1) = and(table(X1,nil,X2,nil),nil),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_46,plain,
table(and(X1,n1),and(X2,n1),n0,n0) = and(table(X1,X2,nil,nil),nil),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_47,plain,
and(table(nil,X1,nil,nil),nil) = and(table(n1,X1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_44]) ).
cnf(c_0_48,plain,
table(and(X1,n1),n1,n0,n1) = and(table(X1,nil,n0,nil),nil),
inference(spm,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_49,plain,
table(and(X1,n1),n1,and(X2,n0),n0) = and(table(X1,nil,X2,nil),nil),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
table(and(X1,n1),n1,n0,n0) = and(table(X1,n1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_15]),c_0_27]) ).
cnf(c_0_51,plain,
table(n0,and(X1,n0),n0,n0) = and(table(n1,X1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_47]) ).
cnf(c_0_52,plain,
and(table(n1,nil,nil,nil),nil) = nil,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_18]) ).
cnf(c_0_53,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
inference(fof_simplification,[status(thm)],[prove_output_configuration]) ).
cnf(c_0_54,plain,
and(table(n0,nil,n0,nil),nil) = table(n0,n1,n0,n1),
inference(spm,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_55,plain,
and(table(X1,nil,n0,nil),nil) = and(table(X1,n1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_31]),c_0_50]) ).
cnf(c_0_56,plain,
and(table(n0,X1,nil,nil),nil) = and(table(n1,X1,nil,nil),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_51]) ).
cnf(c_0_57,plain,
and(table(n1,n1,nil,nil),nil) = nil,
inference(rw,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_58,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
c_0_53 ).
cnf(c_0_59,plain,
table(n0,n1,n0,n1) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]) ).
cnf(c_0_60,axiom,
connect(nil,X1) = X1,
connect_definition1 ).
cnf(c_0_61,axiom,
circuit(top(X1),X2,bottom(X1)),
subsume_symmetric ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_40]),c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWC002-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n006.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:46:43 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 31.63/5.15 % Version: 3.5.1
% 31.63/5.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 31.63/5.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.63/5.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.63/5.15 % Starting new_bool_3 with 300s (1) cores
% 31.63/5.15 % Starting new_bool_1 with 300s (1) cores
% 31.63/5.15 % Starting sh5l with 300s (1) cores
% 31.63/5.15 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1236066 completed with status 0
% 31.63/5.15 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 31.63/5.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 31.63/5.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.63/5.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.63/5.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 31.63/5.15 % No SInE strategy applied
% 31.63/5.15 % Search class: FHUSM-FFMM31-MFFFFFNN
% 31.63/5.15 % partial match(1): FHUSM-FFMF31-MFFFFFNN
% 31.63/5.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 31.63/5.15 % Starting SubtermCWHack with 136s (1) cores
% 31.63/5.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 31.63/5.15 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 31.63/5.15 % Starting new_bool_3 with 136s (1) cores
% 31.63/5.15 % Starting new_bool_1 with 136s (1) cores
% 31.63/5.15 % new_bool_3 with pid 1236075 completed with status 0
% 31.63/5.15 % Result found by new_bool_3
% 31.63/5.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 31.63/5.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.63/5.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.63/5.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 31.63/5.15 % No SInE strategy applied
% 31.63/5.15 % Search class: FHUSM-FFMM31-MFFFFFNN
% 31.63/5.15 % partial match(1): FHUSM-FFMF31-MFFFFFNN
% 31.63/5.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 31.63/5.15 % Starting SubtermCWHack with 136s (1) cores
% 31.63/5.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 31.63/5.15 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 31.63/5.15 % Starting new_bool_3 with 136s (1) cores
% 31.63/5.15 % Preprocessing time : 0.002 s
% 31.63/5.15 % Presaturation interreduction done
% 31.63/5.15
% 31.63/5.15 % Proof found!
% 31.63/5.15 % SZS status Unsatisfiable
% 31.63/5.15 % SZS output start CNFRefutation
% See solution above
% 31.63/5.15 % Parsed axioms : 38
% 31.63/5.15 % Removed by relevancy pruning/SinE : 0
% 31.63/5.15 % Initial clauses : 38
% 31.63/5.15 % Removed in clause preprocessing : 0
% 31.63/5.15 % Initial clauses in saturation : 38
% 31.63/5.15 % Processed clauses : 5543
% 31.63/5.15 % ...of these trivial : 2362
% 31.63/5.15 % ...subsumed : 107
% 31.63/5.15 % ...remaining for further processing : 3074
% 31.63/5.15 % Other redundant clauses eliminated : 0
% 31.63/5.15 % Clauses deleted for lack of memory : 0
% 31.63/5.15 % Backward-subsumed : 0
% 31.63/5.15 % Backward-rewritten : 113
% 31.63/5.15 % Generated clauses : 300542
% 31.63/5.15 % ...of the previous two non-redundant : 281755
% 31.63/5.15 % ...aggressively subsumed : 0
% 31.63/5.15 % Contextual simplify-reflections : 0
% 31.63/5.15 % Paramodulations : 300542
% 31.63/5.15 % Factorizations : 0
% 31.63/5.15 % NegExts : 0
% 31.63/5.15 % Equation resolutions : 0
% 31.63/5.15 % Disequality decompositions : 0
% 31.63/5.15 % Total rewrite steps : 103042
% 31.63/5.15 % ...of those cached : 97072
% 31.63/5.15 % Propositional unsat checks : 0
% 31.63/5.15 % Propositional check models : 0
% 31.63/5.15 % Propositional check unsatisfiable : 0
% 31.63/5.15 % Propositional clauses : 0
% 31.63/5.15 % Propositional clauses after purity: 0
% 31.63/5.15 % Propositional unsat core size : 0
% 31.63/5.15 % Propositional preprocessing time : 0.000
% 31.63/5.15 % Propositional encoding time : 0.000
% 31.63/5.15 % Propositional solver time : 0.000
% 31.63/5.15 % Success case prop preproc time : 0.000
% 31.63/5.15 % Success case prop encoding time : 0.000
% 31.63/5.15 % Success case prop solver time : 0.000
% 31.63/5.15 % Current number of processed clauses : 2923
% 31.63/5.15 % Positive orientable unit clauses : 2823
% 31.63/5.15 % Positive unorientable unit clauses: 0
% 31.63/5.15 % Negative unit clauses : 2
% 31.63/5.15 % Non-unit-clauses : 98
% 31.63/5.15 % Current number of unprocessed clauses: 275810
% 31.63/5.15 % ...number of literals in the above : 275912
% 31.63/5.15 % Current number of archived formulas : 0
% 31.63/5.15 % Current number of archived clauses : 151
% 31.63/5.15 % Clause-clause subsumption calls (NU) : 1449
% 31.63/5.15 % Rec. Clause-clause subsumption calls : 1369
% 31.63/5.15 % Non-unit clause-clause subsumptions : 107
% 31.63/5.15 % Unit Clause-clause subsumption calls : 1289
% 31.63/5.15 % Rewrite failures with RHS unbound : 0
% 31.63/5.15 % BW rewrite match attempts : 574989
% 31.63/5.15 % BW rewrite match successes : 102
% 31.63/5.15 % Condensation attempts : 0
% 31.63/5.15 % Condensation successes : 0
% 31.63/5.15 % Termbank termtop insertions : 6497593
% 31.63/5.15 % Search garbage collected termcells : 25
% 31.63/5.15
% 31.63/5.15 % -------------------------------------------------
% 31.63/5.15 % User time : 4.115 s
% 31.63/5.15 % System time : 0.248 s
% 31.63/5.15 % Total time : 4.362 s
% 31.63/5.15 % Maximum resident set size: 3664 pages
% 31.63/5.15
% 31.63/5.15 % -------------------------------------------------
% 31.63/5.15 % User time : 21.011 s
% 31.63/5.15 % System time : 1.356 s
% 31.63/5.15 % Total time : 22.367 s
% 31.63/5.15 % Maximum resident set size: 4864 pages
% 31.63/5.15 % E exiting
%------------------------------------------------------------------------------