TSTP Solution File: SYN166-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN166-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:09 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 22 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 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,
~ p1(a,b,b),
file('SYN166-1.p',unknown),
[] ).
cnf(10,axiom,
r0(b),
file('SYN166-1.p',unknown),
[] ).
cnf(13,axiom,
m0(a,u,a),
file('SYN166-1.p',unknown),
[] ).
cnf(21,axiom,
l0(a),
file('SYN166-1.p',unknown),
[] ).
cnf(39,axiom,
m0(b,a,a),
file('SYN166-1.p',unknown),
[] ).
cnf(121,axiom,
( ~ p1(u,v,w)
| ~ m0(u,v,w)
| p1(v,x,u) ),
file('SYN166-1.p',unknown),
[] ).
cnf(126,axiom,
( ~ r0(b)
| ~ p1(a,a,a)
| p1(a,b,a) ),
file('SYN166-1.p',unknown),
[] ).
cnf(127,axiom,
( ~ l0(a)
| p1(a,a,a) ),
file('SYN166-1.p',unknown),
[] ).
cnf(371,plain,
p1(a,a,a),
inference(mrr,[status(thm)],[127,21]),
[iquote('0:MRR:127.0,21.0')] ).
cnf(389,plain,
p1(a,b,a),
inference(mrr,[status(thm)],[126,10,371]),
[iquote('0:MRR:126.0,126.1,10.0,371.0')] ).
cnf(419,plain,
( ~ p1(b,a,u)
| ~ m0(b,a,u) ),
inference(res,[status(thm),theory(equality)],[121,1]),
[iquote('0:Res:121.2,1.0')] ).
cnf(1261,plain,
( ~ m0(a,b,a)
| p1(b,u,a) ),
inference(res,[status(thm),theory(equality)],[389,121]),
[iquote('0:Res:389.0,121.0')] ).
cnf(1275,plain,
p1(b,u,a),
inference(mrr,[status(thm)],[1261,13]),
[iquote('0:MRR:1261.0,13.0')] ).
cnf(1279,plain,
~ m0(b,a,a),
inference(res,[status(thm),theory(equality)],[1275,419]),
[iquote('0:Res:1275.0,419.0')] ).
cnf(1280,plain,
$false,
inference(mrr,[status(thm)],[1279,39]),
[iquote('0:MRR:1279.0,39.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN166-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 00:42:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52
% 0.20/0.52 SPASS V 3.9
% 0.20/0.52 SPASS beiseite: Proof found.
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 SPASS derived 757 clauses, backtracked 0 clauses, performed 0 splits and kept 715 clauses.
% 0.20/0.52 SPASS allocated 76534 KBytes.
% 0.20/0.52 SPASS spent 0:00:00.15 on the problem.
% 0.20/0.52 0:00:00.04 for the input.
% 0.20/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.52 0:00:00.01 for inferences.
% 0.20/0.52 0:00:00.00 for the backtracking.
% 0.20/0.52 0:00:00.06 for the reduction.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Here is a proof with depth 2, length 15 :
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 Formulae used in the proof : prove_this axiom_9 axiom_12 axiom_20 axiom_38 rule_082 rule_087 rule_088
% 0.20/0.52
%------------------------------------------------------------------------------