TSTP Solution File: SYN255-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN255-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:46 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 6 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ n2(a),
file('SYN255-1.p',unknown),
[] ).
cnf(10,axiom,
r0(b),
file('SYN255-1.p',unknown),
[] ).
cnf(21,axiom,
l0(a),
file('SYN255-1.p',unknown),
[] ).
cnf(126,axiom,
( ~ r0(b)
| ~ p1(a,a,a)
| p1(a,b,a) ),
file('SYN255-1.p',unknown),
[] ).
cnf(127,axiom,
( ~ l0(a)
| p1(a,a,a) ),
file('SYN255-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN255-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(420,plain,
~ p1(u,v,a),
inference(res,[status(thm),theory(equality)],[176,1]),
[iquote('0:Res:176.1,1.0')] ).
cnf(421,plain,
$false,
inference(unc,[status(thm)],[420,389]),
[iquote('0:UnC:420.0,389.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN255-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n014.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 17:26:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 335 clauses.
% 0.18/0.45 SPASS allocated 76098 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.45 0:00:00.04 for the input.
% 0.18/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.02 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 1, length 10 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : prove_this axiom_9 axiom_20 rule_087 rule_088 rule_137
% 0.18/0.45
%------------------------------------------------------------------------------