%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM387+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 : Mon Jul 18 14:25:49 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 6 RR)
% Number of literals : 7 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(29,axiom,
equal(succ(skc11),skc11),
file('NUM387+1.p',unknown),
[] ).
cnf(32,axiom,
in(u,succ(u)),
file('NUM387+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ in(u,v)
| ~ in(v,u) ),
file('NUM387+1.p',unknown),
[] ).
cnf(52,plain,
in(skc11,skc11),
inference(spr,[status(thm),theory(equality)],[29,32]),
[iquote('0:SpR:29.0,32.0')] ).
cnf(101,plain,
~ in(skc11,skc11),
inference(res,[status(thm),theory(equality)],[52,44]),
[iquote('0:Res:52.0,44.0')] ).
cnf(102,plain,
$false,
inference(mrr,[status(thm)],[101,52]),
[iquote('0:MRR:101.0,52.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM387+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 12:16:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 52 clauses, backtracked 0 clauses, performed 0 splits and kept 57 clauses.
% 0.19/0.44 SPASS allocated 97683 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 6 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t14_ordinal1 t10_ordinal1 antisymmetry_r2_hidden
% 0.19/0.44
%------------------------------------------------------------------------------