TSTP Solution File: SYN110-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN110-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 : 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 : Fri Sep 1 01:50:08 EDT 2023
% Result : Unsatisfiable 0.20s 0.67s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 69
% Syntax : Number of formulae : 99 ( 27 unt; 53 typ; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 69 ( 36 ~; 33 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 42 ( 14 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_024,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_024) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(rule_020,axiom,
( m1(c,c,c)
| ~ l0(c) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_020) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_035,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_035) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(prove_this,negated_conjecture,
~ k2(c,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(c_0_16,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
rule_024 ).
cnf(c_0_17,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_18,axiom,
( m1(c,c,c)
| ~ l0(c) ),
rule_020 ).
cnf(c_0_19,axiom,
l0(c),
axiom_24 ).
cnf(c_0_20,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
rule_035 ).
cnf(c_0_21,axiom,
l0(a),
axiom_20 ).
cnf(c_0_22,plain,
( m1(X1,a,X2)
| ~ m1(X2,c,X2)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_23,plain,
m1(c,c,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,plain,
( m1(X1,a,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
r0(b),
axiom_9 ).
cnf(c_0_26,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_27,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_28,plain,
( m1(X1,a,c)
| ~ q0(X1,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_30,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_31,plain,
m1(b,a,b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_33,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]) ).
cnf(c_0_34,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_35,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_36,plain,
m1(d,a,c),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
~ k2(c,a),
prove_this ).
cnf(c_0_38,plain,
( k2(b,a)
| ~ k2(X1,a)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
k1(a),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_42,plain,
( ~ k2(X1,a)
| ~ k1(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_37]) ).
cnf(c_0_43,plain,
k2(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
k1(b),
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN110-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n014.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 : Sat Aug 26 17:11:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.67 % Version : CSE_E---1.5
% 0.20/0.67 % Problem : theBenchmark.p
% 0.20/0.67 % Proof found
% 0.20/0.67 % SZS status Theorem for theBenchmark.p
% 0.20/0.67 % SZS output start Proof
% See solution above
% 0.20/0.68 % Total time : 0.075000 s
% 0.20/0.68 % SZS output end Proof
% 0.20/0.68 % Total time : 0.083000 s
%------------------------------------------------------------------------------