TSTP Solution File: SYN223-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN223-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:33 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 24 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ l3(u,e),
file('SYN223-1.p',unknown),
[] ).
cnf(14,axiom,
r0(e),
file('SYN223-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN223-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN223-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN223-1.p',unknown),
[] ).
cnf(129,axiom,
( ~ r0(e)
| ~ k0(e)
| p1(e,e,e) ),
file('SYN223-1.p',unknown),
[] ).
cnf(175,axiom,
( ~ k1(b)
| m2(b) ),
file('SYN223-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN223-1.p',unknown),
[] ).
cnf(256,axiom,
( ~ n2(u)
| ~ m2(b)
| l3(u,u) ),
file('SYN223-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(420,plain,
( ~ n2(e)
| ~ m2(b) ),
inference(res,[status(thm),theory(equality)],[256,1]),
[iquote('0:Res:256.2,1.0')] ).
cnf(467,plain,
k1(b),
inference(res,[status(thm),theory(equality)],[16,40]),
[iquote('0:Res:16.0,40.0')] ).
cnf(475,plain,
m2(b),
inference(mrr,[status(thm)],[175,467]),
[iquote('0:MRR:175.0,467.0')] ).
cnf(476,plain,
~ n2(e),
inference(mrr,[status(thm)],[420,475]),
[iquote('0:MRR:420.1,475.0')] ).
cnf(502,plain,
n2(e),
inference(res,[status(thm),theory(equality)],[382,176]),
[iquote('0:Res:382.0,176.0')] ).
cnf(506,plain,
$false,
inference(mrr,[status(thm)],[502,476]),
[iquote('0:MRR:502.0,476.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN223-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n021.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 12:24:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 54 clauses, backtracked 0 clauses, performed 0 splits and kept 376 clauses.
% 0.20/0.48 SPASS allocated 76127 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.20/0.48 0:00:00.05 for the input.
% 0.20/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.00 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.03 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 1, length 16 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : prove_this axiom_13 axiom_15 axiom_28 rule_001 rule_090 rule_136 rule_137 rule_217
% 0.20/0.48
%------------------------------------------------------------------------------