%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWC001-1 : TPTP v9.2.1. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:28:40 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 19 unt; 0 nHn; 21 RR)
% Number of literals : 41 ( 10 equ; 16 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 : 60 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nand_table_definition,negated_conjecture,
( output(nand(X1,X5),nand(X2,X6),nand(X3,X7),nand(X4,X8))
| ~ output(X1,X2,X3,X4)
| ~ output(X5,X6,X7,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(and_definition2,axiom,
and(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition2) ).
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(input2,negated_conjecture,
output(n0,n1,n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input2) ).
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(nand(X1,X5),nand(X2,X6),nand(X3,X7),nand(X4,X8))
| ~ output(X1,X2,X3,X4)
| ~ output(X5,X6,X7,X8) ),
nand_table_definition ).
cnf(c_0_10,axiom,
nand(X1,X2) = not(and(X1,X2)),
nand_definition ).
cnf(c_0_11,negated_conjecture,
( output(not(and(X1,X5)),not(and(X2,X6)),not(and(X3,X7)),not(and(X4,X8)))
| ~ output(X5,X6,X7,X8)
| ~ output(X1,X2,X3,X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_12,axiom,
and(X1,n1) = X1,
and_definition2 ).
cnf(c_0_13,negated_conjecture,
( output(not(and(X1,X2)),not(and(X3,X4)),not(and(X5,X6)),not(X7))
| ~ output(X2,X4,X6,n1)
| ~ output(X1,X3,X5,X7) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
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,negated_conjecture,
( output(not(and(X1,X2)),not(and(X3,X4)),n1,not(X5))
| ~ output(X2,X4,n0,n1)
| ~ output(X1,X3,X6,X5) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
output(n0,n1,n0,n1),
input2 ).
cnf(c_0_18,negated_conjecture,
( output(n1,not(X1),n1,not(X2))
| ~ output(X3,X1,X4,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]),c_0_15]),c_0_12]) ).
cnf(c_0_19,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_20,negated_conjecture,
( output(not(and(X1,X2)),not(and(X3,X4)),not(and(X5,X6)),n1)
| ~ output(X2,X4,X6,n0)
| ~ output(X1,X3,X5,X7) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
output(n1,n0,n1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_19]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( output(not(X1),n1,not(X2),n1)
| ~ output(X1,X3,X2,X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]),c_0_14]),c_0_15]),c_0_12]) ).
cnf(c_0_23,negated_conjecture,
output(n0,n0,n1,n1),
input1 ).
cnf(c_0_24,negated_conjecture,
output(n1,n1,n0,n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ output(n0,n1,n1,n1),
prove_cannot_make_or ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_19]),c_0_15]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWC001-1 : TPTP v9.2.1. Bugfixed v1.1.1.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n026.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 19:10:23 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------