TSTP Solution File: SYN183-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN183-1 : TPTP v8.1.0. Released v1.1.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:19:16 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 17 RR)
% Number of literals : 25 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ q5(e,e),
file('SYN183-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN183-1.p',unknown),
[] ).
cnf(14,axiom,
r0(e),
file('SYN183-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN183-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN183-1.p',unknown),
[] ).
cnf(129,axiom,
( ~ r0(e)
| ~ k0(e)
| p1(e,e,e) ),
file('SYN183-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN183-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN183-1.p',unknown),
[] ).
cnf(316,axiom,
( ~ p3(u,v,w)
| l4(w) ),
file('SYN183-1.p',unknown),
[] ).
cnf(363,axiom,
( ~ l4(u)
| q5(u,u) ),
file('SYN183-1.p',unknown),
[] ).
cnf(382,plain,
p1(e,e,e),
inference(mrr,[status(thm)],[129,14,29]),
[iquote('0:MRR:129.0,129.1,14.0,29.0')] ).
cnf(421,plain,
~ l4(e),
inference(res,[status(thm),theory(equality)],[363,1]),
[iquote('0:Res:363.1,1.0')] ).
cnf(463,plain,
k1(e),
inference(res,[status(thm),theory(equality)],[4,40]),
[iquote('0:Res:4.0,40.0')] ).
cnf(487,plain,
( ~ n2(u)
| l4(u) ),
inference(res,[status(thm),theory(equality)],[283,316]),
[iquote('0:Res:283.1,316.0')] ).
cnf(490,plain,
n2(e),
inference(res,[status(thm),theory(equality)],[382,176]),
[iquote('0:Res:382.0,176.0')] ).
cnf(495,plain,
~ n2(e),
inference(sor,[status(thm)],[421,487]),
[iquote('0:SoR:421.0,487.1')] ).
cnf(496,plain,
$false,
inference(ssi,[status(thm)],[495,29,14,463,490]),
[iquote('0:SSi:495.0,29.0,14.0,463.0,490.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN183-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 14:02:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47
% 0.20/0.47 SPASS V 3.9
% 0.20/0.47 SPASS beiseite: Proof found.
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 SPASS derived 44 clauses, backtracked 0 clauses, performed 0 splits and kept 369 clauses.
% 0.20/0.47 SPASS allocated 76124 KBytes.
% 0.20/0.47 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.47 0:00:00.04 for the input.
% 0.20/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.47 0:00:00.00 for inferences.
% 0.20/0.47 0:00:00.00 for the backtracking.
% 0.20/0.47 0:00:00.03 for the reduction.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Here is a proof with depth 2, length 17 :
% 0.20/0.47 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : prove_this axiom_3 axiom_13 axiom_28 rule_001 rule_090 rule_137 rule_244 rule_277 rule_324
% 0.20/0.47
%------------------------------------------------------------------------------