%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN193-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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 : 600s
% DateTime : Thu Jul 21 12:19:21 EDT 2022
% Result : Unsatisfiable 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 13 unt; 0 nHn; 26 RR)
% Number of literals : 44 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ r4(b),
file('SYN193-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN193-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN193-1.p',unknown),
[] ).
cnf(19,axiom,
p0(c,b),
file('SYN193-1.p',unknown),
[] ).
cnf(31,axiom,
n0(e,e),
file('SYN193-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN193-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN193-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN193-1.p',unknown),
[] ).
cnf(213,axiom,
( ~ n2(u)
| ~ k1(e)
| p2(u,u,u) ),
file('SYN193-1.p',unknown),
[] ).
cnf(220,axiom,
( ~ p1(u,u,u)
| q2(u,u,u) ),
file('SYN193-1.p',unknown),
[] ).
cnf(279,axiom,
( ~ p2(u,v,w)
| n3(w) ),
file('SYN193-1.p',unknown),
[] ).
cnf(294,axiom,
( ~ n0(u,v)
| ~ q2(u,v,w)
| q3(v,w) ),
file('SYN193-1.p',unknown),
[] ).
cnf(337,axiom,
( ~ n3(u)
| ~ p0(v,u)
| ~ q3(w,x)
| r4(u) ),
file('SYN193-1.p',unknown),
[] ).
cnf(459,plain,
k1(e),
inference(res,[status(thm),theory(equality)],[4,40]),
[iquote('0:Res:4.0,40.0')] ).
cnf(467,plain,
( ~ n2(u)
| p2(u,u,u) ),
inference(mrr,[status(thm)],[213,459]),
[iquote('0:MRR:213.1,459.0')] ).
cnf(491,plain,
( ~ n2(u)
| n3(u) ),
inference(res,[status(thm),theory(equality)],[467,279]),
[iquote('0:Res:467.1,279.0')] ).
cnf(541,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(542,plain,
q2(u,u,u),
inference(mrr,[status(thm)],[220,541]),
[iquote('0:MRR:220.0,541.0')] ).
cnf(545,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[541,176]),
[iquote('0:Res:541.0,176.0')] ).
cnf(552,plain,
n3(u),
inference(mrr,[status(thm)],[491,545]),
[iquote('0:MRR:491.0,545.0')] ).
cnf(561,plain,
( ~ p0(u,v)
| ~ q3(w,x)
| r4(v) ),
inference(mrr,[status(thm)],[337,552]),
[iquote('0:MRR:337.0,552.0')] ).
cnf(669,plain,
( ~ q3(u,v)
| r4(b) ),
inference(res,[status(thm),theory(equality)],[19,561]),
[iquote('0:Res:19.0,561.0')] ).
cnf(671,plain,
~ q3(u,v),
inference(mrr,[status(thm)],[669,1]),
[iquote('0:MRR:669.1,1.0')] ).
cnf(672,plain,
( ~ n0(u,v)
| ~ q2(u,v,w) ),
inference(mrr,[status(thm)],[294,671]),
[iquote('0:MRR:294.2,671.0')] ).
cnf(675,plain,
~ n0(u,u),
inference(res,[status(thm),theory(equality)],[542,672]),
[iquote('0:Res:542.0,672.1')] ).
cnf(677,plain,
$false,
inference(unc,[status(thm)],[675,31]),
[iquote('0:UnC:675.0,31.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN193-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n009.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 : 600
% 0.13/0.35 % DateTime : Mon Jul 11 12:24:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50
% 0.20/0.50 SPASS V 3.9
% 0.20/0.50 SPASS beiseite: Proof found.
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 SPASS derived 221 clauses, backtracked 0 clauses, performed 0 splits and kept 457 clauses.
% 0.20/0.50 SPASS allocated 76186 KBytes.
% 0.20/0.50 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.50 0:00:00.04 for the input.
% 0.20/0.50 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.50 0:00:00.00 for inferences.
% 0.20/0.50 0:00:00.00 for the backtracking.
% 0.20/0.50 0:00:00.04 for the reduction.
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Here is a proof with depth 2, length 26 :
% 0.20/0.50 % SZS output start Refutation
% See solution above
% 0.20/0.50 Formulae used in the proof : prove_this axiom_3 axiom_14 axiom_18 axiom_30 rule_001 rule_085 rule_137 rule_174 rule_181 rule_240 rule_255 rule_298
% 0.20/0.50
%------------------------------------------------------------------------------