TSTP Solution File: SYN298-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN298-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:20:03 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 22 RR)
% Number of literals : 36 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 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,
~ s3(b,u),
file('SYN298-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN298-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN298-1.p',unknown),
[] ).
cnf(39,axiom,
m0(b,a,a),
file('SYN298-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN298-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN298-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN298-1.p',unknown),
[] ).
cnf(220,axiom,
( ~ p1(u,u,u)
| q2(u,u,u) ),
file('SYN298-1.p',unknown),
[] ).
cnf(225,axiom,
( ~ l1(u,v)
| q2(v,v,u) ),
file('SYN298-1.p',unknown),
[] ).
cnf(228,axiom,
( ~ s1(b)
| ~ q2(b,u,b)
| s2(u) ),
file('SYN298-1.p',unknown),
[] ).
cnf(312,axiom,
( ~ s2(u)
| ~ m0(v,w,x)
| ~ q2(v,u,v)
| s3(u,x) ),
file('SYN298-1.p',unknown),
[] ).
cnf(419,plain,
( ~ s2(b)
| ~ m0(u,v,w)
| ~ q2(u,b,u) ),
inference(res,[status(thm),theory(equality)],[312,1]),
[iquote('0:Res:312.3,1.0')] ).
cnf(454,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(455,plain,
( ~ q2(b,u,b)
| s2(u) ),
inference(mrr,[status(thm)],[228,454]),
[iquote('0:MRR:228.0,454.0')] ).
cnf(475,plain,
l1(b,b),
inference(res,[status(thm),theory(equality)],[16,41]),
[iquote('0:Res:16.0,41.0')] ).
cnf(501,plain,
q2(b,b,b),
inference(res,[status(thm),theory(equality)],[475,225]),
[iquote('0:Res:475.0,225.0')] ).
cnf(503,plain,
s2(b),
inference(res,[status(thm),theory(equality)],[501,455]),
[iquote('0:Res:501.0,455.0')] ).
cnf(504,plain,
( ~ m0(u,v,w)
| ~ q2(u,b,u) ),
inference(mrr,[status(thm)],[419,503]),
[iquote('0:MRR:419.0,503.0')] ).
cnf(542,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(543,plain,
q2(u,u,u),
inference(mrr,[status(thm)],[220,542]),
[iquote('0:MRR:220.0,542.0')] ).
cnf(672,plain,
~ q2(b,b,b),
inference(res,[status(thm),theory(equality)],[39,504]),
[iquote('0:Res:39.0,504.0')] ).
cnf(677,plain,
$false,
inference(mrr,[status(thm)],[672,543]),
[iquote('0:MRR:672.0,543.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN298-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n017.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 20:01:49 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 222 clauses, backtracked 0 clauses, performed 0 splits and kept 458 clauses.
% 0.20/0.47 SPASS allocated 76186 KBytes.
% 0.20/0.47 SPASS spent 0:00:00.12 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.04 for the reduction.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Here is a proof with depth 3, length 22 :
% 0.20/0.47 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : prove_this axiom_14 axiom_15 axiom_38 rule_002 rule_085 rule_125 rule_181 rule_186 rule_189 rule_273
% 0.20/0.47
%------------------------------------------------------------------------------