TSTP Solution File: SYN582-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN582-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:23:01 EDT 2022
% Result : Unsatisfiable 3.42s 3.65s
% Output : Refutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 13 RR)
% Number of literals : 28 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
p2(u,u),
file('SYN582-1.p',unknown),
[] ).
cnf(3,axiom,
p5(u,u),
file('SYN582-1.p',unknown),
[] ).
cnf(5,axiom,
p2(c13,c18),
file('SYN582-1.p',unknown),
[] ).
cnf(7,axiom,
p11(f4(f6(c15,c13)),c16),
file('SYN582-1.p',unknown),
[] ).
cnf(9,axiom,
~ p11(f4(f6(c15,c18)),c16),
file('SYN582-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ p2(u,v)
| p2(f4(u),f4(v)) ),
file('SYN582-1.p',unknown),
[] ).
cnf(21,axiom,
( ~ p11(u,v)
| ~ p2(v,w)
| ~ p2(u,x)
| p11(x,w) ),
file('SYN582-1.p',unknown),
[] ).
cnf(23,axiom,
( ~ p5(u,v)
| ~ p2(w,x)
| p2(f6(u,w),f6(v,x)) ),
file('SYN582-1.p',unknown),
[] ).
cnf(81,plain,
( ~ p2(c16,u)
| ~ p2(f4(f6(c15,c13)),v)
| p11(v,u) ),
inference(res,[status(thm),theory(equality)],[7,21]),
[iquote('0:Res:7.0,21.0')] ).
cnf(183,plain,
( ~ p2(f6(c15,c13),u)
| ~ p2(c16,v)
| p11(f4(u),v) ),
inference(res,[status(thm),theory(equality)],[14,81]),
[iquote('0:Res:14.1,81.1')] ).
cnf(532,plain,
( ~ p5(c15,u)
| ~ p2(c13,v)
| ~ p2(c16,w)
| p11(f4(f6(u,v)),w) ),
inference(res,[status(thm),theory(equality)],[23,183]),
[iquote('0:Res:23.2,183.0')] ).
cnf(9516,plain,
( ~ p5(c15,c15)
| ~ p2(c13,c18)
| ~ p2(c16,c16) ),
inference(res,[status(thm),theory(equality)],[532,9]),
[iquote('0:Res:532.3,9.0')] ).
cnf(9519,plain,
$false,
inference(mrr,[status(thm)],[9516,3,5,2]),
[iquote('0:MRR:9516.0,9516.1,9516.2,3.0,5.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN582-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 23:39:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.42/3.65
% 3.42/3.65 SPASS V 3.9
% 3.42/3.65 SPASS beiseite: Proof found.
% 3.42/3.65 % SZS status Theorem
% 3.42/3.65 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/3.65 SPASS derived 9316 clauses, backtracked 0 clauses, performed 3 splits and kept 4991 clauses.
% 3.42/3.65 SPASS allocated 68690 KBytes.
% 3.42/3.65 SPASS spent 0:00:03.27 on the problem.
% 3.42/3.65 0:00:00.03 for the input.
% 3.42/3.65 0:00:00.00 for the FLOTTER CNF translation.
% 3.42/3.65 0:00:00.07 for inferences.
% 3.42/3.65 0:00:00.12 for the backtracking.
% 3.42/3.65 0:00:02.98 for the reduction.
% 3.42/3.65
% 3.42/3.65
% 3.42/3.65 Here is a proof with depth 4, length 13 :
% 3.42/3.65 % SZS output start Refutation
% See solution above
% 3.42/3.65 Formulae used in the proof : p2_2 p5_3 p2_5 p11_7 not_p11_9 p2_14 p11_21 p2_23
% 3.42/3.65
%------------------------------------------------------------------------------