TSTP Solution File: HWC001-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWC001-1 : TPTP v8.1.2. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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 : Thu Aug 31 01:57:57 EDT 2023
% Result : Unsatisfiable 0.15s 0.57s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 37 ( 19 unt; 6 typ; 0 def)
% Number of atoms : 49 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% 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 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nand: ( $i * $i ) > $i ).
tff(decl_23,type,
and: ( $i * $i ) > $i ).
tff(decl_24,type,
not: $i > $i ).
tff(decl_25,type,
n0: $i ).
tff(decl_26,type,
n1: $i ).
tff(decl_27,type,
output: ( $i * $i * $i * $i ) > $o ).
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(prove_cannot_make_or,negated_conjecture,
~ output(n0,n1,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cannot_make_or) ).
cnf(input1,negated_conjecture,
output(n0,n0,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input1) ).
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,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_19,negated_conjecture,
( output(not(and(n0,X1)),not(and(n1,X2)),n1,n0)
| ~ output(X1,X2,n0,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( output(not(and(n0,X1)),n0,n1,n0)
| ~ output(X1,n1,n0,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
output(n1,n0,n1,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_15]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( output(not(and(X1,X2)),n1,not(and(X3,X4)),not(X5))
| ~ output(X2,n0,X4,n1)
| ~ output(X1,X6,X3,X5) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( output(not(and(n1,X1)),not(and(n0,X2)),n1,n1)
| ~ output(X1,X2,n0,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( output(not(and(n1,X1)),n1,not(and(n1,X2)),n1)
| ~ output(X1,n0,X2,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( output(not(and(n1,X1)),n1,n1,n1)
| ~ output(X1,n1,n0,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ output(n0,n1,n1,n1),
prove_cannot_make_or ).
cnf(c_0_27,negated_conjecture,
( output(not(and(n1,X1)),n1,n0,n1)
| ~ output(X1,n0,n1,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
output(n0,n0,n1,n1),
input1 ).
cnf(c_0_29,negated_conjecture,
~ output(n1,n1,n0,n1),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_18]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_14]),c_0_15]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : HWC001-1 : TPTP v8.1.2. Bugfixed v1.1.1.
% 0.09/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31 % Computer : n005.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Aug 28 06:39:08 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.54 start to proof: theBenchmark
% 0.15/0.56 % Version : CSE_E---1.5
% 0.15/0.56 % Problem : theBenchmark.p
% 0.15/0.56 % Proof found
% 0.15/0.57 % SZS status Theorem for theBenchmark.p
% 0.15/0.57 % SZS output start Proof
% See solution above
% 0.15/0.57 % Total time : 0.013000 s
% 0.15/0.57 % SZS output end Proof
% 0.15/0.57 % Total time : 0.016000 s
%------------------------------------------------------------------------------