TSTP Solution File: HWC002-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWC002-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 48 ( 36 unt; 12 typ; 0 def)
% Number of atoms : 36 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 40 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
n0: $i ).
tff(decl_23,type,
and: ( $i * $i ) > $i ).
tff(decl_24,type,
n1: $i ).
tff(decl_25,type,
or: ( $i * $i ) > $i ).
tff(decl_26,type,
not: $i > $i ).
tff(decl_27,type,
connect: ( $i * $i ) > $i ).
tff(decl_28,type,
top: $i > $i ).
tff(decl_29,type,
middle: $i > $i ).
tff(decl_30,type,
bottom: $i > $i ).
tff(decl_31,type,
circuit: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
nil: $i ).
tff(decl_33,type,
table: ( $i * $i * $i * $i ) > $i ).
cnf(empty_table,axiom,
table(n0,n0,n0,n0) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_table) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',not_definition2) ).
cnf(full_table,axiom,
table(n1,n1,n1,n1) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',full_table) ).
cnf(or_definition5,axiom,
or(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_definition5) ).
cnf(or_table_definition,axiom,
or(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(or(X1,X5),or(X2,X6),or(X3,X7),or(X4,X8)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_table_definition) ).
cnf(or_definition4,axiom,
or(n1,n1) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',or_definition4) ).
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/sandbox2/benchmark/theBenchmark.p',prove_output_configuration) ).
cnf(or_definition3,axiom,
or(n1,n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',or_definition3) ).
cnf(connect_definition1,axiom,
connect(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connect_definition1) ).
cnf(subsume_symmetric,axiom,
circuit(top(X1),X2,bottom(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsume_symmetric) ).
cnf(c_0_10,axiom,
table(n0,n0,n0,n0) = nil,
empty_table ).
cnf(c_0_11,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_12,axiom,
table(n1,n1,n1,n1) = nil,
full_table ).
cnf(c_0_13,plain,
nil = table(not(n1),not(n1),not(n1),not(n1)),
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_14,axiom,
or(nil,X1) = X1,
or_definition5 ).
cnf(c_0_15,plain,
table(not(n1),not(n1),not(n1),not(n1)) = table(n1,n1,n1,n1),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
or(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(or(X1,X5),or(X2,X6),or(X3,X7),or(X4,X8)),
or_table_definition ).
cnf(c_0_17,plain,
or(table(n1,n1,n1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_18,plain,
table(or(n1,X1),or(n1,X2),or(n1,X3),or(n1,X4)) = table(X1,X2,X3,X4),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
or(n1,n1) = n1,
or_definition4 ).
cnf(c_0_20,plain,
table(or(n1,X1),or(n1,X2),or(n1,X3),n1) = table(X1,X2,X3,n1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
prove_output_configuration ).
cnf(c_0_22,axiom,
or(n1,n0) = n1,
or_definition3 ).
cnf(c_0_23,plain,
table(or(n1,X1),or(n1,X2),n1,n1) = table(X1,X2,n1,n1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ circuit(top(connect(table(not(n1),n1,not(n1),n1),nil)),nil,bottom(connect(table(not(n1),not(n1),n1,n1),nil))),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
or(n1,not(n1)) = n1,
inference(rw,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_26,plain,
table(or(n1,X1),n1,n1,n1) = table(X1,n1,n1,n1),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,plain,
table(or(n1,X1),n1,or(n1,X2),n1) = table(X1,n1,X2,n1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,axiom,
connect(nil,X1) = X1,
connect_definition1 ).
cnf(c_0_29,negated_conjecture,
~ circuit(top(connect(table(not(n1),n1,not(n1),n1),table(n1,n1,n1,n1))),table(n1,n1,n1,n1),bottom(connect(table(not(n1),not(n1),n1,n1),table(n1,n1,n1,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)],[c_0_24,c_0_13]),c_0_13]),c_0_13]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_30,plain,
table(X1,not(n1),n1,n1) = table(X1,n1,n1,n1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
table(X1,n1,not(n1),n1) = table(X1,n1,n1,n1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
table(not(n1),n1,n1,n1) = table(n1,n1,n1,n1),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,plain,
connect(table(n1,n1,n1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_13]),c_0_15]) ).
cnf(c_0_34,axiom,
circuit(top(X1),X2,bottom(X1)),
subsume_symmetric ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[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_29,c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWC002-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 06:55:25 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.006000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.010000 s
%------------------------------------------------------------------------------