TSTP Solution File: SYN589-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN589-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:03 EDT 2022
% Result : Unsatisfiable 0.42s 0.58s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
( ~ p7(u,v)
| ~ p7(u,w)
| p7(w,v) ),
file('SYN589-1.p',unknown),
[] ).
cnf(24,axiom,
p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
file('SYN589-1.p',unknown),
[] ).
cnf(25,axiom,
p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
file('SYN589-1.p',unknown),
[] ).
cnf(26,axiom,
~ p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
file('SYN589-1.p',unknown),
[] ).
cnf(312,plain,
( ~ p7(c20,u)
| p7(u,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))) ),
inference(res,[status(thm),theory(equality)],[24,14]),
[iquote('0:Res:24.0,14.0')] ).
cnf(1206,plain,
~ p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
inference(res,[status(thm),theory(equality)],[312,26]),
[iquote('0:Res:312.1,26.0')] ).
cnf(1210,plain,
$false,
inference(mrr,[status(thm)],[1206,25]),
[iquote('0:MRR:1206.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN589-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 13:56:00 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.42/0.58
% 0.42/0.58 SPASS V 3.9
% 0.42/0.58 SPASS beiseite: Proof found.
% 0.42/0.58 % SZS status Theorem
% 0.42/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.58 SPASS derived 1091 clauses, backtracked 0 clauses, performed 0 splits and kept 441 clauses.
% 0.42/0.58 SPASS allocated 63943 KBytes.
% 0.42/0.58 SPASS spent 0:00:00.22 on the problem.
% 0.42/0.58 0:00:00.04 for the input.
% 0.42/0.58 0:00:00.00 for the FLOTTER CNF translation.
% 0.42/0.58 0:00:00.02 for inferences.
% 0.42/0.58 0:00:00.00 for the backtracking.
% 0.42/0.58 0:00:00.14 for the reduction.
% 0.42/0.58
% 0.42/0.58
% 0.42/0.58 Here is a proof with depth 2, length 7 :
% 0.42/0.58 % SZS output start Refutation
% See solution above
% 0.42/0.58 Formulae used in the proof : p7_14 p7_24 p7_25 not_p7_26
% 0.42/0.58
%------------------------------------------------------------------------------