%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HWC001-1 : TPTP v9.3.1. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 0.12s 0.62s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 21 unt; 0 nHn; 22 RR)
% Number of literals : 39 ( 10 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nand_table_definition,negated_conjecture,
( ~ output(X5,X6,X7,X8)
| ~ output(X1,X2,X3,X4)
| output(nand(X1,X5),nand(X2,X6),nand(X3,X7),nand(X4,X8)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nand_table_definition) ).
cnf(nand_definition,axiom,
nand(X1,X2) = not(and(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nand_definition) ).
cnf(input2,negated_conjecture,
output(n0,n1,n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input2) ).
cnf(and_definition1,axiom,
and(X1,n0) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition1) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_definition1) ).
cnf(and_definition2,axiom,
and(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition2) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_definition2) ).
cnf(input1,negated_conjecture,
output(n0,n0,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input1) ).
cnf(prove_cannot_make_or,negated_conjecture,
~ output(n0,n1,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cannot_make_or) ).
cnf(c_0_9,negated_conjecture,
( ~ output(X5,X6,X7,X8)
| ~ output(X1,X2,X3,X4)
| output(nand(X1,X5),nand(X2,X6),nand(X3,X7),nand(X4,X8)) ),
inference(fof_simplification,[status(thm)],[nand_table_definition]) ).
cnf(c_0_10,negated_conjecture,
( ~ output(X5,X6,X7,X8)
| ~ output(X1,X2,X3,X4)
| output(nand(X1,X5),nand(X2,X6),nand(X3,X7),nand(X4,X8)) ),
c_0_9 ).
cnf(c_0_11,axiom,
nand(X1,X2) = not(and(X1,X2)),
nand_definition ).
cnf(c_0_12,negated_conjecture,
( ~ output(X1,X2,X3,X4)
| ~ output(X5,X6,X7,X8)
| output(not(and(X1,X5)),not(and(X2,X6)),not(and(X3,X7)),not(and(X4,X8))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
output(n0,n1,n0,n1),
input2 ).
cnf(c_0_14,axiom,
and(X1,n0) = n0,
and_definition1 ).
cnf(c_0_15,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_16,axiom,
and(X1,n1) = X1,
and_definition2 ).
cnf(c_0_17,negated_conjecture,
( ~ output(X3,X1,X4,X2)
| output(n1,not(X1),n1,not(X2)) ),
inference(rw,[status(thm)],[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_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_18,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_19,negated_conjecture,
output(n0,n0,n1,n1),
input1 ).
cnf(c_0_20,negated_conjecture,
output(n1,n0,n1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_18]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ output(X3,X4,X1,X2)
| output(n1,n1,not(X1),not(X2)) ),
inference(rw,[status(thm)],[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_12,c_0_19]),c_0_14]),c_0_15]),c_0_14]),c_0_15]),c_0_16]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
output(n1,n1,n1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_15]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ output(n0,n1,n1,n1),
inference(fof_simplification,[status(thm)],[prove_cannot_make_or]) ).
cnf(c_0_24,negated_conjecture,
( ~ output(X1,X3,X2,X4)
| output(not(X1),n1,not(X2),n1) ),
inference(rw,[status(thm)],[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_12,c_0_20]),c_0_16]),c_0_14]),c_0_15]),c_0_16]),c_0_14]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
output(n1,n1,n0,n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ output(n0,n1,n1,n1),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]),c_0_15]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWC001-1 : TPTP v9.3.1. Bugfixed v1.1.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.55 % Computer : n009.cluster.edu
% 0.12/0.55 % Model : x86_64 x86_64
% 0.12/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.55 % Memory : 8046.5625MB
% 0.12/0.55 % OS : Linux 6.8.0-71-generic
% 0.12/0.55 % CPULimit : 300
% 0.12/0.55 % WCLimit : 300
% 0.12/0.55 % DateTime : Sun Sep 20 20:46:58 UTC 2026
% 0.12/0.56 % CPUTime :
% 0.12/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.60 Running first-order theorem proving
% 0.12/0.60 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.62 % Version: 3.5.1
% 0.12/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.62 % Starting sh5l with 300s (1) cores
% 0.12/0.62 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32273 completed with status 0
% 0.12/0.62 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.62 % No SInE strategy applied
% 0.12/0.62 % Search class: FHUSS-FFSS21-SFFFFFNN
% 0.12/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.62 % new_bool_3 with pid 32282 completed with status 0
% 0.12/0.62 % Result found by new_bool_3
% 0.12/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.62 % No SInE strategy applied
% 0.12/0.62 % Search class: FHUSS-FFSS21-SFFFFFNN
% 0.12/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.62 % Preprocessing time : 0.001 s
% 0.12/0.62 % Presaturation interreduction done
% 0.12/0.62
% 0.12/0.62 % Proof found!
% 0.12/0.62 % SZS status Unsatisfiable
% 0.12/0.62 % SZS output start CNFRefutation
% See solution above
% 0.12/0.62 % Parsed axioms : 9
% 0.12/0.62 % Removed by relevancy pruning/SinE : 0
% 0.12/0.62 % Initial clauses : 9
% 0.12/0.62 % Removed in clause preprocessing : 1
% 0.12/0.62 % Initial clauses in saturation : 8
% 0.12/0.62 % Processed clauses : 28
% 0.12/0.62 % ...of these trivial : 3
% 0.12/0.62 % ...subsumed : 0
% 0.12/0.62 % ...remaining for further processing : 25
% 0.12/0.62 % Other redundant clauses eliminated : 0
% 0.12/0.62 % Clauses deleted for lack of memory : 0
% 0.12/0.62 % Backward-subsumed : 0
% 0.12/0.62 % Backward-rewritten : 0
% 0.12/0.62 % Generated clauses : 32
% 0.12/0.62 % ...of the previous two non-redundant : 17
% 0.12/0.62 % ...aggressively subsumed : 0
% 0.12/0.62 % Contextual simplify-reflections : 0
% 0.12/0.62 % Paramodulations : 32
% 0.12/0.62 % Factorizations : 0
% 0.12/0.62 % NegExts : 0
% 0.12/0.62 % Equation resolutions : 0
% 0.12/0.62 % Disequality decompositions : 0
% 0.12/0.62 % Total rewrite steps : 93
% 0.12/0.62 % ...of those cached : 76
% 0.12/0.62 % Propositional unsat checks : 0
% 0.12/0.62 % Propositional check models : 0
% 0.12/0.62 % Propositional check unsatisfiable : 0
% 0.12/0.62 % Propositional clauses : 0
% 0.12/0.62 % Propositional clauses after purity: 0
% 0.12/0.62 % Propositional unsat core size : 0
% 0.12/0.62 % Propositional preprocessing time : 0.000
% 0.12/0.62 % Propositional encoding time : 0.000
% 0.12/0.62 % Propositional solver time : 0.000
% 0.12/0.62 % Success case prop preproc time : 0.000
% 0.12/0.62 % Success case prop encoding time : 0.000
% 0.12/0.62 % Success case prop solver time : 0.000
% 0.12/0.62 % Current number of processed clauses : 17
% 0.12/0.62 % Positive orientable unit clauses : 12
% 0.12/0.62 % Positive unorientable unit clauses: 0
% 0.12/0.62 % Negative unit clauses : 1
% 0.12/0.62 % Non-unit-clauses : 4
% 0.12/0.62 % Current number of unprocessed clauses: 5
% 0.12/0.62 % ...number of literals in the above : 10
% 0.12/0.62 % Current number of archived formulas : 0
% 0.12/0.62 % Current number of archived clauses : 9
% 0.12/0.62 % Clause-clause subsumption calls (NU) : 6
% 0.12/0.62 % Rec. Clause-clause subsumption calls : 6
% 0.12/0.62 % Non-unit clause-clause subsumptions : 0
% 0.12/0.62 % Unit Clause-clause subsumption calls : 0
% 0.12/0.62 % Rewrite failures with RHS unbound : 0
% 0.12/0.62 % BW rewrite match attempts : 11
% 0.12/0.62 % BW rewrite match successes : 0
% 0.12/0.62 % Condensation attempts : 0
% 0.12/0.62 % Condensation successes : 0
% 0.12/0.62 % Termbank termtop insertions : 680
% 0.12/0.62 % Search garbage collected termcells : 8
% 0.12/0.62
% 0.12/0.62 % -------------------------------------------------
% 0.12/0.62 % User time : 0.003 s
% 0.12/0.62 % System time : 0.004 s
% 0.12/0.62 % Total time : 0.006 s
% 0.12/0.62 % Maximum resident set size: 3632 pages
% 0.12/0.62
% 0.12/0.62 % -------------------------------------------------
% 0.12/0.62 % User time : 0.014 s
% 0.12/0.62 % System time : 0.016 s
% 0.12/0.62 % Total time : 0.030 s
% 0.12/0.62 % Maximum resident set size: 4608 pages
% 0.12/0.62 % E exiting
%------------------------------------------------------------------------------