TSTP Solution File: NUM290+1 by leanCoP---2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : leanCoP---2.2
% Problem  : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leancop_casc.sh %s %d

% Computer : n009.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 11:39:51 EDT 2022

% Result   : Theorem 0.40s 1.40s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : leancop_casc.sh %s %d
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 04:42:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.40/1.40  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/1.41  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/1.41  
% 0.40/1.41  %-----------------------------------------------------
% 0.40/1.41  fof(n2_less_n3, conjecture, less(n2, n3), file('/export/starexec/sandbox/benchmark/theBenchmark.p', n2_less_n3)).
% 0.40/1.41  fof(rdn2, axiom, rdn_translate(n2, rdn_pos(rdnn(n2))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdn2)).
% 0.40/1.41  fof(rdn3, axiom, rdn_translate(n3, rdn_pos(rdnn(n3))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdn3)).
% 0.40/1.41  fof(rdn_positive_less23, axiom, rdn_positive_less(rdnn(n2), rdnn(n3)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_positive_less23)).
% 0.40/1.41  fof(less_entry_point_pos_pos, axiom, ! [_271657, _271660, _271663, _271666] : (rdn_translate(_271657, rdn_pos(_271663)) & rdn_translate(_271660, rdn_pos(_271666)) & rdn_positive_less(_271663, _271666) => less(_271657, _271660)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_entry_point_pos_pos)).
% 0.40/1.41  
% 0.40/1.41  cnf(1, plain, [less(n2, n3)], clausify(n2_less_n3)).
% 0.40/1.41  cnf(2, plain, [-(rdn_translate(n2, rdn_pos(rdnn(n2))))], clausify(rdn2)).
% 0.40/1.41  cnf(3, plain, [-(rdn_translate(n3, rdn_pos(rdnn(n3))))], clausify(rdn3)).
% 0.40/1.41  cnf(4, plain, [-(rdn_positive_less(rdnn(n2), rdnn(n3)))], clausify(rdn_positive_less23)).
% 0.40/1.41  cnf(5, plain, [-(less(_174454, _174525)), rdn_translate(_174454, rdn_pos(_174595)), rdn_translate(_174525, rdn_pos(_174664)), rdn_positive_less(_174595, _174664)], clausify(less_entry_point_pos_pos)).
% 0.40/1.41  
% 0.40/1.41  cnf('1',plain,[less(n2, n3)],start(1)).
% 0.40/1.41  cnf('1.1',plain,[-(less(n2, n3)), rdn_translate(n2, rdn_pos(rdnn(n2))), rdn_translate(n3, rdn_pos(rdnn(n3))), rdn_positive_less(rdnn(n2), rdnn(n3))],extension(5,bind([[_174454, _174525, _174595, _174664], [n2, n3, rdnn(n2), rdnn(n3)]]))).
% 0.40/1.41  cnf('1.1.1',plain,[-(rdn_translate(n2, rdn_pos(rdnn(n2))))],extension(2)).
% 0.40/1.41  cnf('1.1.2',plain,[-(rdn_translate(n3, rdn_pos(rdnn(n3))))],extension(3)).
% 0.40/1.41  cnf('1.1.3',plain,[-(rdn_positive_less(rdnn(n2), rdnn(n3)))],extension(4)).
% 0.40/1.41  %-----------------------------------------------------
% 0.40/1.42  
% 0.40/1.42  % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------