TSTP Solution File: SYN208-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN208-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:27 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 22 RR)
% Number of literals : 37 ( 0 equ; 19 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 : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ s3(d,b),
file('SYN208-1.p',unknown),
[] ).
cnf(2,axiom,
s0(d),
file('SYN208-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN208-1.p',unknown),
[] ).
cnf(20,axiom,
m0(u,d,v),
file('SYN208-1.p',unknown),
[] ).
cnf(37,axiom,
q0(a,b),
file('SYN208-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN208-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN208-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN208-1.p',unknown),
[] ).
cnf(220,axiom,
( ~ p1(u,u,u)
| q2(u,u,u) ),
file('SYN208-1.p',unknown),
[] ).
cnf(229,axiom,
( ~ s1(a)
| ~ s0(d)
| s2(d) ),
file('SYN208-1.p',unknown),
[] ).
cnf(312,axiom,
( ~ s2(u)
| ~ m0(v,w,x)
| ~ q2(v,u,v)
| s3(u,x) ),
file('SYN208-1.p',unknown),
[] ).
cnf(375,plain,
( ~ s1(a)
| s2(d) ),
inference(mrr,[status(thm)],[229,2]),
[iquote('0:MRR:229.1,2.0')] ).
cnf(419,plain,
( ~ s2(d)
| ~ m0(u,v,b)
| ~ q2(u,d,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(541,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(542,plain,
q2(u,u,u),
inference(mrr,[status(thm)],[220,541]),
[iquote('0:MRR:220.0,541.0')] ).
cnf(602,plain,
( ~ q0(u,v)
| s1(u) ),
inference(ems,[status(thm)],[165,454]),
[iquote('0:EmS:165.0,454.0')] ).
cnf(603,plain,
s1(a),
inference(res,[status(thm),theory(equality)],[37,602]),
[iquote('0:Res:37.0,602.0')] ).
cnf(609,plain,
s2(d),
inference(mrr,[status(thm)],[375,603]),
[iquote('0:MRR:375.0,603.0')] ).
cnf(621,plain,
( ~ m0(u,v,b)
| ~ q2(u,d,u) ),
inference(mrr,[status(thm)],[419,609]),
[iquote('0:MRR:419.0,609.0')] ).
cnf(666,plain,
~ q2(u,d,u),
inference(res,[status(thm),theory(equality)],[20,621]),
[iquote('0:Res:20.0,621.0')] ).
cnf(667,plain,
$false,
inference(unc,[status(thm)],[666,542]),
[iquote('0:UnC:666.0,542.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN208-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 08:21:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 212 clauses, backtracked 0 clauses, performed 0 splits and kept 450 clauses.
% 0.19/0.48 SPASS allocated 76181 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.48 0:00:00.04 for the input.
% 0.19/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.04 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 3, length 22 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : prove_this axiom_1 axiom_14 axiom_19 axiom_36 rule_085 rule_125 rule_126 rule_181 rule_190 rule_273
% 0.19/0.48
%------------------------------------------------------------------------------