%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN566-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %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 : 600s
% DateTime : Thu Jul 21 12:22:55 EDT 2022
% Result : Unsatisfiable 1.84s 2.00s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of clauses : 28 ( 11 unt; 0 nHn; 28 RR)
% Number of literals : 54 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
p2(u,u),
file('SYN566-1.p',unknown),
[] ).
cnf(3,axiom,
p3(u,u),
file('SYN566-1.p',unknown),
[] ).
cnf(4,axiom,
p7(u,u),
file('SYN566-1.p',unknown),
[] ).
cnf(5,axiom,
p10(c15,c11),
file('SYN566-1.p',unknown),
[] ).
cnf(6,axiom,
p8(c12,c13),
file('SYN566-1.p',unknown),
[] ).
cnf(7,axiom,
p2(c14,f6(c15)),
file('SYN566-1.p',unknown),
[] ).
cnf(8,axiom,
p3(c13,f4(c14)),
file('SYN566-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ p2(u,v)
| p3(f4(u),f4(v)) ),
file('SYN566-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ p3(u,v)
| ~ p3(u,w)
| p3(w,v) ),
file('SYN566-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ p8(u,f4(f6(v)))
| p8(u,f4(f5(v))) ),
file('SYN566-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ p3(u,v)
| ~ p8(w,u)
| ~ p7(w,x)
| p8(x,v) ),
file('SYN566-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ p10(u,c11)
| ~ p2(v,f5(u))
| ~ p3(w,f4(v))
| ~ p8(c12,w) ),
file('SYN566-1.p',unknown),
[] ).
cnf(24,plain,
( ~ p3(u,v)
| p3(v,u) ),
inference(res,[status(thm),theory(equality)],[3,14]),
[iquote('0:Res:3.0,14.0')] ).
cnf(28,plain,
p3(f4(c14),c13),
inference(res,[status(thm),theory(equality)],[8,24]),
[iquote('0:Res:8.0,24.0')] ).
cnf(31,plain,
( ~ p3(f4(c14),u)
| p3(u,c13) ),
inference(res,[status(thm),theory(equality)],[28,14]),
[iquote('0:Res:28.0,14.0')] ).
cnf(46,plain,
( ~ p2(c14,u)
| p3(f4(u),c13) ),
inference(res,[status(thm),theory(equality)],[9,31]),
[iquote('0:Res:9.1,31.0')] ).
cnf(59,plain,
( ~ p2(c14,u)
| ~ p3(f4(u),v)
| p3(v,c13) ),
inference(res,[status(thm),theory(equality)],[46,14]),
[iquote('0:Res:46.1,14.0')] ).
cnf(79,plain,
( ~ p10(u,c11)
| ~ p3(v,f4(f5(u)))
| ~ p8(c12,v) ),
inference(res,[status(thm),theory(equality)],[2,19]),
[iquote('0:Res:2.0,19.1')] ).
cnf(139,plain,
( ~ p2(u,v)
| ~ p2(c14,u)
| p3(f4(v),c13) ),
inference(res,[status(thm),theory(equality)],[9,59]),
[iquote('0:Res:9.1,59.1')] ).
cnf(230,plain,
( ~ p10(u,c11)
| ~ p8(c12,f4(f5(u))) ),
inference(res,[status(thm),theory(equality)],[3,79]),
[iquote('0:Res:3.0,79.1')] ).
cnf(304,plain,
( ~ p2(c14,c14)
| p3(f4(f6(c15)),c13) ),
inference(res,[status(thm),theory(equality)],[7,139]),
[iquote('0:Res:7.0,139.0')] ).
cnf(318,plain,
p3(f4(f6(c15)),c13),
inference(mrr,[status(thm)],[304,2]),
[iquote('0:MRR:304.0,2.0')] ).
cnf(340,plain,
p3(c13,f4(f6(c15))),
inference(res,[status(thm),theory(equality)],[318,24]),
[iquote('0:Res:318.0,24.0')] ).
cnf(345,plain,
( ~ p8(u,c13)
| ~ p7(u,v)
| p8(v,f4(f6(c15))) ),
inference(res,[status(thm),theory(equality)],[340,18]),
[iquote('0:Res:340.0,18.0')] ).
cnf(5957,plain,
( ~ p7(c12,u)
| p8(u,f4(f6(c15))) ),
inference(res,[status(thm),theory(equality)],[6,345]),
[iquote('0:Res:6.0,345.0')] ).
cnf(5959,plain,
( ~ p7(c12,u)
| p8(u,f4(f5(c15))) ),
inference(res,[status(thm),theory(equality)],[5957,16]),
[iquote('0:Res:5957.1,16.0')] ).
cnf(5992,plain,
( ~ p7(c12,c12)
| ~ p10(c15,c11) ),
inference(res,[status(thm),theory(equality)],[5959,230]),
[iquote('0:Res:5959.1,230.1')] ).
cnf(5998,plain,
$false,
inference(mrr,[status(thm)],[5992,4,5]),
[iquote('0:MRR:5992.0,5992.1,4.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN566-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 12:46:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.84/2.00
% 1.84/2.00 SPASS V 3.9
% 1.84/2.00 SPASS beiseite: Proof found.
% 1.84/2.00 % SZS status Theorem
% 1.84/2.00 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.84/2.00 SPASS derived 5733 clauses, backtracked 0 clauses, performed 0 splits and kept 2543 clauses.
% 1.84/2.00 SPASS allocated 66618 KBytes.
% 1.84/2.00 SPASS spent 0:00:01.64 on the problem.
% 1.84/2.00 0:00:00.03 for the input.
% 1.84/2.00 0:00:00.00 for the FLOTTER CNF translation.
% 1.84/2.00 0:00:00.05 for inferences.
% 1.84/2.00 0:00:00.00 for the backtracking.
% 1.84/2.00 0:00:01.52 for the reduction.
% 1.84/2.00
% 1.84/2.00
% 1.84/2.00 Here is a proof with depth 12, length 28 :
% 1.84/2.00 % SZS output start Refutation
% See solution above
% 1.84/2.00 Formulae used in the proof : p2_2 p3_3 p7_4 p10_5 p8_6 p2_7 p3_8 p3_9 p3_14 p8_16 p8_18 not_p10_19
% 1.84/2.00
%------------------------------------------------------------------------------