%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM025-2 : TPTP v8.1.0. Bugfixed v4.0.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 : Mon Jul 18 14:23:44 EDT 2022
% Result : Unsatisfiable 0.21s 0.41s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 1 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ greater_or_equalish(u,v)
| greater_or_equalish(u,w)
| greater_or_equalish(w,v) ),
file('NUM025-2.p',unknown),
[] ).
cnf(8,axiom,
greater_or_equalish(u,u),
file('NUM025-2.p',unknown),
[] ).
cnf(9,axiom,
~ greater_or_equalish(a,b),
file('NUM025-2.p',unknown),
[] ).
cnf(10,axiom,
~ greater_or_equalish(b,a),
file('NUM025-2.p',unknown),
[] ).
cnf(18,plain,
( ~ greater_or_equalish(b,u)
| greater_or_equalish(a,u) ),
inference(res,[status(thm),theory(equality)],[4,10]),
[iquote('0:Res:4.2,10.0')] ).
cnf(20,plain,
~ greater_or_equalish(b,b),
inference(res,[status(thm),theory(equality)],[18,9]),
[iquote('0:Res:18.1,9.0')] ).
cnf(21,plain,
$false,
inference(mrr,[status(thm)],[20,8]),
[iquote('0:MRR:20.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM025-2 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 03:02:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.41
% 0.21/0.41 SPASS V 3.9
% 0.21/0.41 SPASS beiseite: Proof found.
% 0.21/0.41 % SZS status Theorem
% 0.21/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 19 clauses.
% 0.21/0.41 SPASS allocated 63095 KBytes.
% 0.21/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.21/0.41 0:00:00.03 for the input.
% 0.21/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.41 0:00:00.00 for inferences.
% 0.21/0.41 0:00:00.00 for the backtracking.
% 0.21/0.41 0:00:00.00 for the reduction.
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Here is a proof with depth 2, length 7 :
% 0.21/0.41 % SZS output start Refutation
% See solution above
% 0.21/0.41 Formulae used in the proof : transitivity_of_less no_number_less_than_itself a_less_than_b prove_b_not_less_than_a
% 0.21/0.41
%------------------------------------------------------------------------------