TSTP Solution File: SYN114-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN114-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:48 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ k3(u,u,b),
file('SYN114-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN114-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN114-1.p',unknown),
[] ).
cnf(175,axiom,
( ~ k1(b)
| m2(b) ),
file('SYN114-1.p',unknown),
[] ).
cnf(251,axiom,
( ~ m2(u)
| k3(u,u,u) ),
file('SYN114-1.p',unknown),
[] ).
cnf(425,plain,
~ m2(b),
inference(res,[status(thm),theory(equality)],[251,1]),
[iquote('0:Res:251.1,1.0')] ).
cnf(435,plain,
~ k1(b),
inference(mrr,[status(thm)],[175,425]),
[iquote('0:MRR:175.1,425.0')] ).
cnf(478,plain,
k1(b),
inference(res,[status(thm),theory(equality)],[16,40]),
[iquote('0:Res:16.0,40.0')] ).
cnf(486,plain,
$false,
inference(mrr,[status(thm)],[478,435]),
[iquote('0:MRR:478.0,435.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : SYN114-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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:15:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46
% 0.19/0.46 SPASS V 3.9
% 0.19/0.46 SPASS beiseite: Proof found.
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 SPASS derived 35 clauses, backtracked 0 clauses, performed 0 splits and kept 367 clauses.
% 0.19/0.46 SPASS allocated 76113 KBytes.
% 0.19/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.46 0:00:00.04 for the input.
% 0.19/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.46 0:00:00.00 for inferences.
% 0.19/0.46 0:00:00.00 for the backtracking.
% 0.19/0.46 0:00:00.03 for the reduction.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Here is a proof with depth 1, length 9 :
% 0.19/0.46 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : prove_this axiom_15 rule_001 rule_136 rule_212
% 0.19/0.46
%------------------------------------------------------------------------------