TSTP Solution File: SYN264-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN264-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:50 EDT 2023
% Result : Unsatisfiable 0.22s 0.68s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 60
% Syntax : Number of formulae : 72 ( 13 unt; 53 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 13 |; 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 : 18 ( 7 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_063,axiom,
( p1(X1,X1,X2)
| ~ n0(d,X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_063) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(rule_071,axiom,
( p1(X1,X2,X1)
| ~ l0(X3)
| ~ p1(X2,X4,X1)
| ~ s0(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_071) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(prove_this,negated_conjecture,
~ p1(e,c,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(c_0_7,axiom,
( p1(X1,X1,X2)
| ~ n0(d,X1)
| ~ k0(X2) ),
rule_063 ).
cnf(c_0_8,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_9,axiom,
( p1(X1,X2,X1)
| ~ l0(X3)
| ~ p1(X2,X4,X1)
| ~ s0(b) ),
rule_071 ).
cnf(c_0_10,axiom,
s0(b),
axiom_5 ).
cnf(c_0_11,plain,
( p1(c,c,X1)
| ~ k0(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,axiom,
k0(e),
axiom_28 ).
cnf(c_0_13,plain,
( p1(X1,X2,X1)
| ~ p1(X2,X3,X1)
| ~ l0(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,plain,
p1(c,c,e),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ p1(e,c,e),
prove_this ).
cnf(c_0_16,axiom,
l0(c),
axiom_24 ).
cnf(c_0_17,plain,
~ l0(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN264-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.36 % Computer : n014.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sat Aug 26 18:45:17 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.22/0.60 start to proof: theBenchmark
% 0.22/0.68 % Version : CSE_E---1.5
% 0.22/0.68 % Problem : theBenchmark.p
% 0.22/0.68 % Proof found
% 0.22/0.68 % SZS status Theorem for theBenchmark.p
% 0.22/0.68 % SZS output start Proof
% See solution above
% 0.22/0.68 % Total time : 0.065000 s
% 0.22/0.68 % SZS output end Proof
% 0.22/0.68 % Total time : 0.070000 s
%------------------------------------------------------------------------------