TSTP Solution File: ALG069-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ALG069-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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 : Wed Aug 30 16:01:11 EDT 2023
% Result : Unsatisfiable 0.21s 0.62s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 40 ( 28 unt; 12 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-4 aty)
% Number of variables : 28 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ifeq2: ( $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(decl_24,type,
sorti1: $i > $i ).
tff(decl_25,type,
true: $i ).
tff(decl_26,type,
op1: ( $i * $i ) > $i ).
tff(decl_27,type,
sorti2: $i > $i ).
tff(decl_28,type,
op2: ( $i * $i ) > $i ).
tff(decl_29,type,
sK2_ax3_V: $i > $i ).
tff(decl_30,type,
tuple: ( $i * $i ) > $i ).
tff(decl_31,type,
sK1_ax4_U: $i ).
tff(decl_32,type,
h: $i > $i ).
tff(decl_33,type,
j: $i > $i ).
cnf(co1_3,negated_conjecture,
ifeq(sorti2(X1),true,sorti1(j(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(ax4,axiom,
sorti2(sK1_ax4_U) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(ax3_1,axiom,
ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_1) ).
cnf(co1,negated_conjecture,
ifeq(sorti1(X1),true,sorti2(h(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(ax3,axiom,
ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(co1_5,negated_conjecture,
ifeq2(sorti2(X1),true,h(j(X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(ax4_1,axiom,
tuple(op2(X1,X1),sorti2(X1)) != tuple(sK1_ax4_U,true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4_1) ).
cnf(co1_1,negated_conjecture,
ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1))) = h(op1(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_10,negated_conjecture,
ifeq(sorti2(X1),true,sorti1(j(X1)),true) = true,
co1_3 ).
cnf(c_0_11,axiom,
sorti2(sK1_ax4_U) = true,
ax4 ).
cnf(c_0_12,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_13,axiom,
ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true) = true,
ax3_1 ).
cnf(c_0_14,negated_conjecture,
sorti1(j(sK1_ax4_U)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ifeq(sorti1(X1),true,sorti2(h(X1)),true) = true,
co1 ).
cnf(c_0_16,negated_conjecture,
sorti1(sK2_ax3_V(j(sK1_ax4_U))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_17,axiom,
ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1) = X1,
ax3 ).
cnf(c_0_18,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_19,negated_conjecture,
ifeq2(sorti2(X1),true,h(j(X1)),X1) = X1,
co1_5 ).
cnf(c_0_20,axiom,
tuple(op2(X1,X1),sorti2(X1)) != tuple(sK1_ax4_U,true),
ax4_1 ).
cnf(c_0_21,negated_conjecture,
sorti2(h(sK2_ax3_V(j(sK1_ax4_U)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).
cnf(c_0_22,negated_conjecture,
ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1))) = h(op1(X2,X1)),
co1_1 ).
cnf(c_0_23,negated_conjecture,
op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))) = j(sK1_ax4_U),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
h(j(sK1_ax4_U)) = sK1_ax4_U,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
tuple(op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))),true) != tuple(sK1_ax4_U,true),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))) = sK1_ax4_U,
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_22,c_0_23]),c_0_16]),c_0_16]),c_0_24]),c_0_18]),c_0_24]),c_0_18]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ALG069-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 03:31:04 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.62 % Version : CSE_E---1.5
% 0.21/0.62 % Problem : theBenchmark.p
% 0.21/0.62 % Proof found
% 0.21/0.62 % SZS status Theorem for theBenchmark.p
% 0.21/0.62 % SZS output start Proof
% See solution above
% 0.21/0.63 % Total time : 0.041000 s
% 0.21/0.63 % SZS output end Proof
% 0.21/0.63 % Total time : 0.044000 s
%------------------------------------------------------------------------------