%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:30:53 EDT 2022
% Result : Theorem 0.19s 0.55s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 15 unt; 0 nHn; 19 RR)
% Number of literals : 23 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
greater(vd203,vd204),
file('NUM836+1.p',unknown),
[] ).
cnf(2,axiom,
less(vd203,vd204),
file('NUM836+1.p',unknown),
[] ).
cnf(6,axiom,
~ equal(vplus(u,v),u),
file('NUM836+1.p',unknown),
[] ).
cnf(10,axiom,
equal(vplus(u,v),vplus(v,u)),
file('NUM836+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(u,vplus(v,w))
| less(v,u) ),
file('NUM836+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ less(u,v)
| equal(vplus(u,skf4(u,v)),v) ),
file('NUM836+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ greater(u,v)
| equal(vplus(v,skf5(v,u)),u) ),
file('NUM836+1.p',unknown),
[] ).
cnf(22,axiom,
equal(vplus(vplus(u,v),w),vplus(u,vplus(v,w))),
file('NUM836+1.p',unknown),
[] ).
cnf(26,plain,
equal(vplus(vd203,skf4(vd203,vd204)),vd204),
inference(res,[status(thm),theory(equality)],[2,19]),
[iquote('0:Res:2.0,19.0')] ).
cnf(27,plain,
equal(vplus(vd204,skf5(vd204,vd203)),vd203),
inference(res,[status(thm),theory(equality)],[1,20]),
[iquote('0:Res:1.0,20.0')] ).
cnf(169,plain,
less(u,vplus(u,v)),
inference(eqr,[status(thm),theory(equality)],[13]),
[iquote('0:EqR:13.0')] ).
cnf(187,plain,
less(u,vplus(v,u)),
inference(spr,[status(thm),theory(equality)],[10,169]),
[iquote('0:SpR:10.0,169.0')] ).
cnf(231,plain,
( ~ less(u,v)
| ~ equal(v,u) ),
inference(spl,[status(thm),theory(equality)],[19,6]),
[iquote('0:SpL:19.1,6.0')] ).
cnf(239,plain,
less(u,vplus(v,vplus(w,u))),
inference(spr,[status(thm),theory(equality)],[22,187]),
[iquote('0:SpR:22.0,187.0')] ).
cnf(816,plain,
less(u,vplus(v,vplus(u,w))),
inference(spr,[status(thm),theory(equality)],[10,239]),
[iquote('0:SpR:10.0,239.0')] ).
cnf(1043,plain,
less(vd204,vplus(u,vd203)),
inference(spr,[status(thm),theory(equality)],[27,816]),
[iquote('0:SpR:27.0,816.0')] ).
cnf(1062,plain,
less(vd204,vplus(vd203,u)),
inference(spr,[status(thm),theory(equality)],[10,1043]),
[iquote('0:SpR:10.0,1043.0')] ).
cnf(1098,plain,
~ equal(vplus(vd203,u),vd204),
inference(res,[status(thm),theory(equality)],[1062,231]),
[iquote('0:Res:1062.0,231.0')] ).
cnf(1099,plain,
$false,
inference(unc,[status(thm)],[1098,26]),
[iquote('0:UnC:1098.0,26.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n026.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 08:34:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.55
% 0.19/0.55 SPASS V 3.9
% 0.19/0.55 SPASS beiseite: Proof found.
% 0.19/0.55 % SZS status Theorem
% 0.19/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 SPASS derived 986 clauses, backtracked 0 clauses, performed 0 splits and kept 495 clauses.
% 0.19/0.55 SPASS allocated 85842 KBytes.
% 0.19/0.55 SPASS spent 0:00:00.19 on the problem.
% 0.19/0.55 0:00:00.04 for the input.
% 0.19/0.55 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.55 0:00:00.01 for inferences.
% 0.19/0.55 0:00:00.00 for the backtracking.
% 0.19/0.55 0:00:00.09 for the reduction.
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Here is a proof with depth 7, length 19 :
% 0.19/0.55 % SZS output start Refutation
% See solution above
% 0.19/0.55 Formulae used in the proof : dis_a40_ex_a40_cond_a40_conseq_a40_131_a41__a44__a32_0_a41__a44__a32_1_a41__a41_ ass_a40_cond_a40_goal_a40_88_a41__a44__a32_0_a41__a44__a32_3_a41_ ass_a40_cond_a40_61_a44__a32_0_a41__a44__a32_0_a41_ def_a40_cond_a40_conseq_a40_axiom_a40_3_a41__a41__a44__a32_12_a41__a44__a32_1_a41_ def_a40_cond_a40_conseq_a40_axiom_a40_3_a41__a41__a44__a32_11_a41__a44__a32_1_a41_ ass_a40_cond_a40_33_a44__a32_0_a41__a44__a32_0_a41_
% 0.19/0.55
%------------------------------------------------------------------------------