TSTP Solution File: SYN207-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN207-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 : n004.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:35 EDT 2023
% Result : Unsatisfiable 0.22s 0.71s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 69
% Syntax : Number of formulae : 102 ( 23 unt; 53 typ; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 94 ( 49 ~; 45 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 48 >; 42 *; 0 +; 0 <<)
% Number of predicates : 49 ( 48 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 67 ( 29 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
d: $i ).
tff(decl_23,type,
s0: $i > $o ).
tff(decl_24,type,
e: $i ).
tff(decl_25,type,
q0: ( $i * $i ) > $o ).
tff(decl_26,type,
n0: ( $i * $i ) > $o ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
m0: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
b: $i ).
tff(decl_30,type,
r0: $i > $o ).
tff(decl_31,type,
p0: ( $i * $i ) > $o ).
tff(decl_32,type,
c: $i ).
tff(decl_33,type,
l0: $i > $o ).
tff(decl_34,type,
k0: $i > $o ).
tff(decl_35,type,
k1: $i > $o ).
tff(decl_36,type,
l1: ( $i * $i ) > $o ).
tff(decl_37,type,
m1: ( $i * $i * $i ) > $o ).
tff(decl_38,type,
n1: ( $i * $i * $i ) > $o ).
tff(decl_39,type,
p1: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
q1: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
r1: $i > $o ).
tff(decl_42,type,
s1: $i > $o ).
tff(decl_43,type,
k2: ( $i * $i ) > $o ).
tff(decl_44,type,
l2: ( $i * $i ) > $o ).
tff(decl_45,type,
m2: $i > $o ).
tff(decl_46,type,
n2: $i > $o ).
tff(decl_47,type,
p2: ( $i * $i * $i ) > $o ).
tff(decl_48,type,
q2: ( $i * $i * $i ) > $o ).
tff(decl_49,type,
r2: $i > $o ).
tff(decl_50,type,
s2: $i > $o ).
tff(decl_51,type,
k3: ( $i * $i * $i ) > $o ).
tff(decl_52,type,
l3: ( $i * $i ) > $o ).
tff(decl_53,type,
m3: ( $i * $i * $i ) > $o ).
tff(decl_54,type,
n3: $i > $o ).
tff(decl_55,type,
p3: ( $i * $i * $i ) > $o ).
tff(decl_56,type,
q3: ( $i * $i ) > $o ).
tff(decl_57,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_58,type,
s3: ( $i * $i ) > $o ).
tff(decl_59,type,
k4: $i > $o ).
tff(decl_60,type,
l4: $i > $o ).
tff(decl_61,type,
m4: ( $i * $i ) > $o ).
tff(decl_62,type,
n4: ( $i * $i ) > $o ).
tff(decl_63,type,
p4: ( $i * $i * $i ) > $o ).
tff(decl_64,type,
q4: ( $i * $i ) > $o ).
tff(decl_65,type,
r4: $i > $o ).
tff(decl_66,type,
s4: $i > $o ).
tff(decl_67,type,
k5: $i > $o ).
tff(decl_68,type,
l5: $i > $o ).
tff(decl_69,type,
m5: ( $i * $i ) > $o ).
tff(decl_70,type,
n5: ( $i * $i ) > $o ).
tff(decl_71,type,
p5: ( $i * $i * $i ) > $o ).
tff(decl_72,type,
q5: ( $i * $i ) > $o ).
tff(decl_73,type,
r5: ( $i * $i ) > $o ).
tff(decl_74,type,
s5: $i > $o ).
cnf(rule_093,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_093) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_184,axiom,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_184) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(prove_this,negated_conjecture,
~ s3(c,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_183,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_183) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(c_0_16,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
rule_093 ).
cnf(c_0_17,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_18,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,axiom,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
rule_184 ).
cnf(c_0_23,plain,
q1(c,c,c),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
s1(b),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
rule_273 ).
cnf(c_0_27,plain,
q2(c,c,c),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_29,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( s3(c,X1)
| ~ s2(c)
| ~ m0(c,X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_32,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
~ s3(c,c),
prove_this ).
cnf(c_0_34,plain,
( s3(c,X1)
| ~ s2(c) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_36,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
rule_183 ).
cnf(c_0_37,axiom,
l0(c),
axiom_24 ).
cnf(c_0_38,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ s2(c),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_25])]) ).
cnf(c_0_41,plain,
( q2(X1,c,X2)
| ~ l2(X2,X1)
| ~ k1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_42,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_43,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_44,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_45,negated_conjecture,
~ q2(b,c,b),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( q2(X1,c,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
k1(b),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.37 % Computer : n004.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat Aug 26 21:38:38 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.22/0.71 % Version : CSE_E---1.5
% 0.22/0.71 % Problem : theBenchmark.p
% 0.22/0.71 % Proof found
% 0.22/0.71 % SZS status Theorem for theBenchmark.p
% 0.22/0.71 % SZS output start Proof
% See solution above
% 0.22/0.71 % Total time : 0.107000 s
% 0.22/0.71 % SZS output end Proof
% 0.22/0.71 % Total time : 0.115000 s
%------------------------------------------------------------------------------