TSTP Solution File: SYN216-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN216-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:31 EDT 2022
% Result : Unsatisfiable 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 24 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ l2(a,a),
file('SYN216-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN216-1.p',unknown),
[] ).
cnf(17,axiom,
m0(c,b,a),
file('SYN216-1.p',unknown),
[] ).
cnf(18,axiom,
q0(u,d),
file('SYN216-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN216-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN216-1.p',unknown),
[] ).
cnf(172,axiom,
( ~ s1(u)
| ~ p0(v,v)
| ~ m0(w,u,x)
| l2(x,x) ),
file('SYN216-1.p',unknown),
[] ).
cnf(421,plain,
( ~ s1(u)
| ~ p0(v,v)
| ~ m0(w,u,a) ),
inference(res,[status(thm),theory(equality)],[172,1]),
[iquote('0:Res:172.3,1.0')] ).
cnf(456,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(604,plain,
( ~ q0(u,v)
| s1(u) ),
inference(ems,[status(thm)],[165,456]),
[iquote('0:EmS:165.0,456.0')] ).
cnf(610,plain,
s1(u),
inference(res,[status(thm),theory(equality)],[18,604]),
[iquote('0:Res:18.0,604.0')] ).
cnf(615,plain,
( ~ p0(u,u)
| ~ m0(v,w,a) ),
inference(mrr,[status(thm)],[421,610]),
[iquote('0:MRR:421.0,610.0')] ).
cnf(624,plain,
~ p0(u,u),
inference(res,[status(thm),theory(equality)],[17,615]),
[iquote('0:Res:17.0,615.1')] ).
cnf(628,plain,
$false,
inference(unc,[status(thm)],[624,15]),
[iquote('0:UnC:624.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN216-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 11 20:26:28 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 174 clauses, backtracked 0 clauses, performed 0 splits and kept 440 clauses.
% 0.18/0.48 SPASS allocated 76172 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.18/0.48 0:00:00.04 for the input.
% 0.18/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.00 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.04 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 3, length 14 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : prove_this axiom_14 axiom_16 axiom_17 rule_125 rule_126 rule_133
% 0.18/0.48
%------------------------------------------------------------------------------