TSTP Solution File: HWC003-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWC003-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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.18s 0.58s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 38
% Syntax : Number of formulae : 63 ( 27 unt; 27 typ; 0 def)
% Number of atoms : 47 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 17 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 11 >; 31 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-10 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-8 aty)
% Number of variables : 86 ( 19 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,
list: ( $i * $i ) > $i ).
tff(decl_28,type,
add_inverter: ( $i * $i ) > $i ).
tff(decl_29,type,
inverter_table: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_30,type,
make_reverse_list: $i > $i ).
tff(decl_31,type,
r00m: $i ).
tff(decl_32,type,
possible_reversion: ( $i * $i * $i ) > $i ).
tff(decl_33,type,
r01m: $i ).
tff(decl_34,type,
r10m: $i ).
tff(decl_35,type,
r11m: $i ).
tff(decl_36,type,
r0m0: $i ).
tff(decl_37,type,
r0m1: $i ).
tff(decl_38,type,
r1m0: $i ).
tff(decl_39,type,
r1m1: $i ).
tff(decl_40,type,
rm00: $i ).
tff(decl_41,type,
rm01: $i ).
tff(decl_42,type,
rm10: $i ).
tff(decl_43,type,
rm11: $i ).
tff(decl_44,type,
list_reversion: ( $i * $i ) > $i ).
tff(decl_45,type,
end: $i ).
tff(decl_46,type,
not_reversion: $i ).
tff(decl_47,type,
output: ( $i * $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(decl_48,type,
test: ( $i * $i * $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
cnf(inverter_test,axiom,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9)))
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverter_test) ).
cnf(make_reverse_list_definition2,axiom,
make_reverse_list(X1) = end,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_reverse_list_definition2) ).
cnf(add_inverter_definition2,axiom,
add_inverter(X1,X2) = list(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_inverter_definition2) ).
cnf(input3,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',input3) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',not_definition2) ).
cnf(create_test,axiom,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',create_test) ).
cnf(prove_cannot_construct_this,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cannot_construct_this) ).
cnf(add_inverter_definition1,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_inverter_definition1) ).
cnf(input2,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',input2) ).
cnf(input1,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',input1) ).
cnf(c_0_11,axiom,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9)))
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inverter_test ).
cnf(c_0_12,axiom,
make_reverse_list(X1) = end,
make_reverse_list_definition2 ).
cnf(c_0_13,axiom,
add_inverter(X1,X2) = list(X2,X1),
add_inverter_definition2 ).
cnf(c_0_14,plain,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9),end)
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
input3 ).
cnf(c_0_16,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_17,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_18,axiom,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
create_test ).
cnf(c_0_19,negated_conjecture,
test(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1),end),
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(rw,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1) ),
prove_cannot_construct_this ).
cnf(c_0_21,negated_conjecture,
output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
add_inverter_definition1 ).
cnf(c_0_23,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
input2 ).
cnf(c_0_24,negated_conjecture,
( ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1))
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
list(X1,list(X3,X2)) = list(X3,list(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_13]),c_0_13]) ).
cnf(c_0_26,negated_conjecture,
test(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1),end),
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(rw,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_16]),c_0_16]),c_0_17]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
input1 ).
cnf(c_0_30,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
list(X1,list(X2,list(X3,X4))) = list(X3,list(X1,list(X2,X4))),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
test(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1),end),
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(rw,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_29]),c_0_16]),c_0_16]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_16]),c_0_16]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWC003-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.32 % Computer : n014.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % 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:36:16 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.56 start to proof: theBenchmark
% 0.18/0.58 % Version : CSE_E---1.5
% 0.18/0.58 % Problem : theBenchmark.p
% 0.18/0.58 % Proof found
% 0.18/0.58 % SZS status Theorem for theBenchmark.p
% 0.18/0.58 % SZS output start Proof
% See solution above
% 0.18/0.58 % Total time : 0.010000 s
% 0.18/0.58 % SZS output end Proof
% 0.18/0.58 % Total time : 0.014000 s
%------------------------------------------------------------------------------