TSTP Solution File: SYN231-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN231-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:37 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 25 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 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,
~ l3(d,u),
file('SYN231-1.p',unknown),
[] ).
cnf(2,axiom,
s0(d),
file('SYN231-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN231-1.p',unknown),
[] ).
cnf(25,axiom,
l0(c),
file('SYN231-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN231-1.p',unknown),
[] ).
cnf(35,axiom,
n0(c,d),
file('SYN231-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN231-1.p',unknown),
[] ).
cnf(118,axiom,
( ~ k1(u)
| ~ k0(e)
| ~ l0(c)
| p1(u,u,u) ),
file('SYN231-1.p',unknown),
[] ).
cnf(175,axiom,
( ~ k1(b)
| m2(b) ),
file('SYN231-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN231-1.p',unknown),
[] ).
cnf(190,axiom,
( ~ k1(d)
| ~ s0(d)
| p2(d,d,d) ),
file('SYN231-1.p',unknown),
[] ).
cnf(256,axiom,
( ~ n2(u)
| ~ m2(b)
| l3(u,u) ),
file('SYN231-1.p',unknown),
[] ).
cnf(279,axiom,
( ~ p2(u,v,w)
| n3(w) ),
file('SYN231-1.p',unknown),
[] ).
cnf(379,plain,
( ~ k1(d)
| p2(d,d,d) ),
inference(mrr,[status(thm)],[190,2]),
[iquote('0:MRR:190.1,2.0')] ).
cnf(399,plain,
( ~ k1(u)
| p1(u,u,u) ),
inference(mrr,[status(thm)],[118,29,25]),
[iquote('0:MRR:118.1,118.2,29.0,25.0')] ).
cnf(421,plain,
( ~ n2(d)
| ~ m2(b) ),
inference(res,[status(thm),theory(equality)],[256,1]),
[iquote('0:Res:256.2,1.0')] ).
cnf(466,plain,
k1(d),
inference(res,[status(thm),theory(equality)],[35,40]),
[iquote('0:Res:35.0,40.0')] ).
cnf(469,plain,
k1(b),
inference(res,[status(thm),theory(equality)],[16,40]),
[iquote('0:Res:16.0,40.0')] ).
cnf(474,plain,
p2(d,d,d),
inference(mrr,[status(thm)],[379,466]),
[iquote('0:MRR:379.0,466.0')] ).
cnf(477,plain,
m2(b),
inference(mrr,[status(thm)],[175,469]),
[iquote('0:MRR:175.0,469.0')] ).
cnf(478,plain,
~ n2(d),
inference(mrr,[status(thm)],[421,477]),
[iquote('0:MRR:421.1,477.0')] ).
cnf(499,plain,
n3(d),
inference(res,[status(thm),theory(equality)],[474,279]),
[iquote('0:Res:474.0,279.0')] ).
cnf(504,plain,
( ~ k1(u)
| n2(u) ),
inference(res,[status(thm),theory(equality)],[399,176]),
[iquote('0:Res:399.1,176.0')] ).
cnf(508,plain,
~ k1(d),
inference(sor,[status(thm)],[478,504]),
[iquote('0:SoR:478.0,504.1')] ).
cnf(509,plain,
$false,
inference(ssi,[status(thm)],[508,2,466,499]),
[iquote('0:SSi:508.0,2.0,466.0,499.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN231-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n010.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 15:18:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 56 clauses, backtracked 0 clauses, performed 0 splits and kept 379 clauses.
% 0.19/0.47 SPASS allocated 76129 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.03 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 2, length 25 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : prove_this axiom_1 axiom_15 axiom_24 axiom_28 axiom_34 rule_001 rule_079 rule_136 rule_137 rule_151 rule_217 rule_240
% 0.19/0.47
%------------------------------------------------------------------------------