TSTP Solution File: SYN214-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN214-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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 : Fri Sep 1 01:50:37 EDT 2023
% Result : Unsatisfiable 0.59s 0.74s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 73
% Syntax : Number of formulae : 105 ( 50 unt; 55 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 94 ( 49 >; 45 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 55 ( 55 usr; 6 con; 0-4 aty)
% Number of variables : 71 ( 35 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
d: $i ).
tff(decl_24,type,
s0: $i > $i ).
tff(decl_25,type,
true: $i ).
tff(decl_26,type,
e: $i ).
tff(decl_27,type,
q0: ( $i * $i ) > $i ).
tff(decl_28,type,
n0: ( $i * $i ) > $i ).
tff(decl_29,type,
a: $i ).
tff(decl_30,type,
m0: ( $i * $i * $i ) > $i ).
tff(decl_31,type,
b: $i ).
tff(decl_32,type,
r0: $i > $i ).
tff(decl_33,type,
p0: ( $i * $i ) > $i ).
tff(decl_34,type,
c: $i ).
tff(decl_35,type,
l0: $i > $i ).
tff(decl_36,type,
k0: $i > $i ).
tff(decl_37,type,
k1: $i > $i ).
tff(decl_38,type,
l1: ( $i * $i ) > $i ).
tff(decl_39,type,
m1: ( $i * $i * $i ) > $i ).
tff(decl_40,type,
n1: ( $i * $i * $i ) > $i ).
tff(decl_41,type,
p1: ( $i * $i * $i ) > $i ).
tff(decl_42,type,
q1: ( $i * $i * $i ) > $i ).
tff(decl_43,type,
r1: $i > $i ).
tff(decl_44,type,
s1: $i > $i ).
tff(decl_45,type,
k2: ( $i * $i ) > $i ).
tff(decl_46,type,
l2: ( $i * $i ) > $i ).
tff(decl_47,type,
m2: $i > $i ).
tff(decl_48,type,
n2: $i > $i ).
tff(decl_49,type,
p2: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
q2: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
r2: $i > $i ).
tff(decl_52,type,
s2: $i > $i ).
tff(decl_53,type,
k3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
l3: ( $i * $i ) > $i ).
tff(decl_55,type,
m3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
n3: $i > $i ).
tff(decl_57,type,
p3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
q3: ( $i * $i ) > $i ).
tff(decl_59,type,
r3: ( $i * $i * $i ) > $i ).
tff(decl_60,type,
s3: ( $i * $i ) > $i ).
tff(decl_61,type,
k4: $i > $i ).
tff(decl_62,type,
l4: $i > $i ).
tff(decl_63,type,
m4: ( $i * $i ) > $i ).
tff(decl_64,type,
n4: ( $i * $i ) > $i ).
tff(decl_65,type,
p4: ( $i * $i * $i ) > $i ).
tff(decl_66,type,
q4: ( $i * $i ) > $i ).
tff(decl_67,type,
r4: $i > $i ).
tff(decl_68,type,
s4: $i > $i ).
tff(decl_69,type,
k5: $i > $i ).
tff(decl_70,type,
l5: $i > $i ).
tff(decl_71,type,
m5: ( $i * $i ) > $i ).
tff(decl_72,type,
n5: ( $i * $i ) > $i ).
tff(decl_73,type,
p5: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
q5: ( $i * $i ) > $i ).
tff(decl_75,type,
r5: ( $i * $i ) > $i ).
tff(decl_76,type,
s5: $i > $i ).
cnf(rule_001,axiom,
ifeq(n0(X1,X2),true,k1(X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_001) ).
cnf(axiom_15,axiom,
n0(a,b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_159,axiom,
ifeq(k1(X1),true,p2(X1,X1,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_159) ).
cnf(rule_002,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).
cnf(rule_085,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_186,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_186) ).
cnf(rule_137,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).
cnf(rule_298,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_298) ).
cnf(axiom_18,axiom,
p0(c,b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18) ).
cnf(rule_255,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_255) ).
cnf(rule_244,axiom,
ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_244) ).
cnf(rule_277,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_277) ).
cnf(rule_329,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_329) ).
cnf(prove_this,negated_conjecture,
s5(c) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_18,axiom,
ifeq(n0(X1,X2),true,k1(X2),true) = true,
rule_001 ).
cnf(c_0_19,axiom,
n0(a,b) = true,
axiom_15 ).
cnf(c_0_20,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_21,axiom,
ifeq(k1(X1),true,p2(X1,X1,X1),true) = true,
rule_159 ).
cnf(c_0_22,plain,
k1(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_24,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_25,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_085 ).
cnf(c_0_26,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_27,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_28,plain,
p2(b,b,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]) ).
cnf(c_0_29,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
rule_186 ).
cnf(c_0_30,plain,
l1(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]) ).
cnf(c_0_31,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
rule_137 ).
cnf(c_0_32,plain,
p1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20]) ).
cnf(c_0_33,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
rule_298 ).
cnf(c_0_34,axiom,
p0(c,b) = true,
axiom_18 ).
cnf(c_0_35,plain,
n3(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]) ).
cnf(c_0_36,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_37,plain,
q2(e,e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_20]) ).
cnf(c_0_38,axiom,
ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
rule_244 ).
cnf(c_0_39,plain,
n2(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]) ).
cnf(c_0_40,plain,
ifeq(q3(X1,X2),true,r4(b),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_20]),c_0_20]) ).
cnf(c_0_41,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_24]),c_0_20]),c_0_20]) ).
cnf(c_0_42,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
rule_277 ).
cnf(c_0_43,plain,
p3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_20]) ).
cnf(c_0_44,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
rule_329 ).
cnf(c_0_45,plain,
r4(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_20]) ).
cnf(c_0_46,plain,
l4(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20]) ).
cnf(c_0_47,negated_conjecture,
s5(c) != true,
prove_this ).
cnf(c_0_48,plain,
s5(X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_20]),c_0_20]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN214-10 : TPTP v8.1.2. Released v7.5.0.
% 0.09/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 19:40:09 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.61 start to proof: theBenchmark
% 0.59/0.74 % Version : CSE_E---1.5
% 0.59/0.74 % Problem : theBenchmark.p
% 0.59/0.74 % Proof found
% 0.59/0.74 % SZS status Theorem for theBenchmark.p
% 0.59/0.74 % SZS output start Proof
% See solution above
% 0.59/0.74 % Total time : 0.113000 s
% 0.59/0.74 % SZS output end Proof
% 0.59/0.74 % Total time : 0.122000 s
%------------------------------------------------------------------------------