TSTP Solution File: SYN205-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN205-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 : n005.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:34 EDT 2023
% Result : Unsatisfiable 0.19s 0.71s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 72
% Syntax : Number of formulae : 110 ( 25 unt; 53 typ; 0 def)
% Number of atoms : 114 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 118 ( 61 ~; 57 |; 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 : 75 ( 19 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_050,axiom,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(rule_179,axiom,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_179) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_069,axiom,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_069) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(prove_this,negated_conjecture,
~ s3(a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_182,axiom,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_182) ).
cnf(rule_177,axiom,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_177) ).
cnf(rule_054,axiom,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_054) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(c_0_19,axiom,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
rule_050 ).
cnf(c_0_20,axiom,
s0(b),
axiom_5 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,plain,
( n1(X1,X2,X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_23,axiom,
l0(a),
axiom_20 ).
cnf(c_0_24,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_25,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_26,axiom,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
rule_179 ).
cnf(c_0_27,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
k1(a),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
rule_273 ).
cnf(c_0_30,plain,
q2(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( s3(a,X1)
| ~ s2(a)
| ~ m0(a,X2,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_33,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_34,axiom,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
rule_069 ).
cnf(c_0_35,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_36,negated_conjecture,
~ s3(a,d),
prove_this ).
cnf(c_0_37,plain,
( s3(a,X1)
| ~ s2(a) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_39,plain,
s1(b),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_40,axiom,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
rule_182 ).
cnf(c_0_41,plain,
p1(X1,X1,b),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_42,axiom,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
rule_177 ).
cnf(c_0_43,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_44,axiom,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
rule_054 ).
cnf(c_0_45,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_46,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_48,plain,
( q2(X1,X2,X1)
| ~ q2(X2,b,X1)
| ~ n1(X2,X1,b) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( q2(X1,X2,X2)
| ~ k0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_50,axiom,
k0(b),
axiom_32 ).
cnf(c_0_51,plain,
( n1(a,X1,X1)
| ~ l1(X2,a)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_52,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_45,c_0_25]) ).
cnf(c_0_53,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( q2(b,X1,b)
| ~ n1(X1,b,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_55,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_23])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN205-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 17:21:38 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.71 % Version : CSE_E---1.5
% 0.19/0.71 % Problem : theBenchmark.p
% 0.19/0.71 % Proof found
% 0.19/0.71 % SZS status Theorem for theBenchmark.p
% 0.19/0.71 % SZS output start Proof
% See solution above
% 0.19/0.72 % Total time : 0.146000 s
% 0.19/0.72 % SZS output end Proof
% 0.19/0.72 % Total time : 0.154000 s
%------------------------------------------------------------------------------