TSTP Solution File: SYN110-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN110-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:18:46 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 35 RR)
% Number of literals : 59 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ k2(c,a),
file('SYN110-1.p',unknown),
[] ).
cnf(13,axiom,
m0(a,u,a),
file('SYN110-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN110-1.p',unknown),
[] ).
cnf(20,axiom,
m0(u,d,v),
file('SYN110-1.p',unknown),
[] ).
cnf(21,axiom,
l0(a),
file('SYN110-1.p',unknown),
[] ).
cnf(34,axiom,
q0(d,c),
file('SYN110-1.p',unknown),
[] ).
cnf(38,axiom,
n0(b,a),
file('SYN110-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN110-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN110-1.p',unknown),
[] ).
cnf(63,axiom,
( ~ m0(a,u,a)
| ~ q0(v,w)
| ~ m1(w,c,w)
| m1(v,a,w) ),
file('SYN110-1.p',unknown),
[] ).
cnf(64,axiom,
( ~ m0(u,v,w)
| m1(w,w,w) ),
file('SYN110-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN110-1.p',unknown),
[] ).
cnf(146,axiom,
( ~ m0(u,d,u)
| ~ m0(e,d,u)
| q1(e,u,u) ),
file('SYN110-1.p',unknown),
[] ).
cnf(166,axiom,
( ~ k1(u)
| ~ k2(u,v)
| ~ m1(w,v,x)
| k2(x,v) ),
file('SYN110-1.p',unknown),
[] ).
cnf(168,axiom,
( ~ q1(u,v,v)
| k2(v,v) ),
file('SYN110-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN110-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN110-1.p',unknown),
[] ).
cnf(338,axiom,
( ~ l1(u,v)
| ~ p3(w,v,x)
| s4(u) ),
file('SYN110-1.p',unknown),
[] ).
cnf(403,plain,
q1(e,u,u),
inference(mrr,[status(thm)],[146,20]),
[iquote('0:MRR:146.0,146.1,20.0,20.0')] ).
cnf(416,plain,
( ~ q0(u,v)
| ~ m1(v,c,v)
| m1(u,a,v) ),
inference(mrr,[status(thm)],[63,13]),
[iquote('0:MRR:63.0,13.0')] ).
cnf(418,plain,
( ~ k1(u)
| ~ k2(u,a)
| ~ m1(v,a,c) ),
inference(res,[status(thm),theory(equality)],[166,1]),
[iquote('0:Res:166.3,1.0')] ).
cnf(455,plain,
k1(a),
inference(res,[status(thm),theory(equality)],[38,40]),
[iquote('0:Res:38.0,40.0')] ).
cnf(470,plain,
l1(a,a),
inference(res,[status(thm),theory(equality)],[38,41]),
[iquote('0:Res:38.0,41.0')] ).
cnf(540,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(544,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[540,176]),
[iquote('0:Res:540.0,176.0')] ).
cnf(546,plain,
p3(u,u,u),
inference(mrr,[status(thm)],[283,544]),
[iquote('0:MRR:283.0,544.0')] ).
cnf(576,plain,
k2(u,u),
inference(res,[status(thm),theory(equality)],[403,168]),
[iquote('0:Res:403.0,168.0')] ).
cnf(658,plain,
m1(u,u,u),
inference(res,[status(thm),theory(equality)],[20,64]),
[iquote('0:Res:20.0,64.0')] ).
cnf(732,plain,
( ~ l1(u,v)
| s4(u) ),
inference(res,[status(thm),theory(equality)],[546,338]),
[iquote('0:Res:546.0,338.1')] ).
cnf(736,plain,
s4(a),
inference(res,[status(thm),theory(equality)],[470,732]),
[iquote('0:Res:470.0,732.0')] ).
cnf(1116,plain,
( ~ q0(u,c)
| m1(u,a,c) ),
inference(res,[status(thm),theory(equality)],[658,416]),
[iquote('0:Res:658.0,416.1')] ).
cnf(1129,plain,
m1(d,a,c),
inference(res,[status(thm),theory(equality)],[34,1116]),
[iquote('0:Res:34.0,1116.0')] ).
cnf(1132,plain,
( ~ k1(u)
| ~ k2(u,a) ),
inference(res,[status(thm),theory(equality)],[1129,418]),
[iquote('0:Res:1129.0,418.2')] ).
cnf(1133,plain,
~ k1(a),
inference(res,[status(thm),theory(equality)],[576,1132]),
[iquote('0:Res:576.0,1132.1')] ).
cnf(1134,plain,
$false,
inference(ssi,[status(thm)],[1133,21,455,736]),
[iquote('0:SSi:1133.0,21.0,455.0,736.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN110-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 13:23:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.51
% 0.19/0.51 SPASS V 3.9
% 0.19/0.51 SPASS beiseite: Proof found.
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51 SPASS derived 625 clauses, backtracked 0 clauses, performed 0 splits and kept 655 clauses.
% 0.19/0.51 SPASS allocated 76440 KBytes.
% 0.19/0.51 SPASS spent 0:00:00.17 on the problem.
% 0.19/0.51 0:00:00.04 for the input.
% 0.19/0.51 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.51 0:00:00.01 for inferences.
% 0.19/0.51 0:00:00.00 for the backtracking.
% 0.19/0.51 0:00:00.07 for the reduction.
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Here is a proof with depth 5, length 35 :
% 0.19/0.51 % SZS output start Refutation
% See solution above
% 0.19/0.51 Formulae used in the proof : prove_this axiom_12 axiom_14 axiom_19 axiom_20 axiom_33 axiom_37 rule_001 rule_002 rule_024 rule_025 rule_085 rule_107 rule_127 rule_129 rule_137 rule_244 rule_299
% 0.19/0.51
%------------------------------------------------------------------------------