TSTP Solution File: SYN106-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN106-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:44 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ k1(e),
file('SYN106-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN106-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN106-1.p',unknown),
[] ).
cnf(419,plain,
~ n0(u,e),
inference(res,[status(thm),theory(equality)],[40,1]),
[iquote('0:Res:40.1,1.0')] ).
cnf(420,plain,
$false,
inference(unc,[status(thm)],[419,4]),
[iquote('0:UnC:419.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN106-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n022.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 01:22:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 334 clauses.
% 0.20/0.48 SPASS allocated 76097 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.48 0:00:00.04 for the input.
% 0.20/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.00 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.02 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 1, length 5 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : prove_this axiom_3 rule_001
% 0.20/0.48
%------------------------------------------------------------------------------