TSTP Solution File: SYN319-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN319-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:20:13 EDT 2022
% Result : Unsatisfiable 0.12s 0.40s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 1 nHn; 10 RR)
% Number of literals : 13 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( g(u)
| f(v) ),
file('SYN319-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ f(u)
| h(u) ),
file('SYN319-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ g(u)
| h(u) ),
file('SYN319-1.p',unknown),
[] ).
cnf(7,axiom,
~ h(z2(u,v)),
file('SYN319-1.p',unknown),
[] ).
cnf(14,plain,
f(u),
inference(spt,[spt(split,[position(s1)])],[1]),
[iquote('1:Spt:1.1')] ).
cnf(16,plain,
h(u),
inference(mrr,[status(thm)],[5,14]),
[iquote('1:MRR:5.0,14.0')] ).
cnf(17,plain,
$false,
inference(unc,[status(thm)],[16,7]),
[iquote('1:UnC:16.0,7.0')] ).
cnf(18,plain,
g(u),
inference(spt,[spt(split,[position(s2)])],[1]),
[iquote('1:Spt:17.0,1.0')] ).
cnf(19,plain,
h(u),
inference(mrr,[status(thm)],[6,18]),
[iquote('1:MRR:6.0,18.0')] ).
cnf(20,plain,
$false,
inference(unc,[status(thm)],[19,7]),
[iquote('1:UnC:19.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : SYN319-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n015.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:47:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.40
% 0.12/0.40 SPASS V 3.9
% 0.12/0.40 SPASS beiseite: Proof found.
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 SPASS derived 4 clauses, backtracked 5 clauses, performed 1 splits and kept 15 clauses.
% 0.12/0.40 SPASS allocated 75581 KBytes.
% 0.12/0.40 SPASS spent 0:00:00.05 on the problem.
% 0.12/0.40 0:00:00.03 for the input.
% 0.12/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.12/0.40 0:00:00.00 for inferences.
% 0.12/0.40 0:00:00.00 for the backtracking.
% 0.12/0.40 0:00:00.00 for the reduction.
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Here is a proof with depth 1, length 10 :
% 0.12/0.40 % SZS output start Refutation
% See solution above
% 0.12/0.40 Formulae used in the proof : clause1 clause5 clause6 clause7
% 0.12/0.40
%------------------------------------------------------------------------------