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

View Problem - Process Solution

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

% Computer : n017.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 : Sun Jul 17 12:16:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : leancop_casc.sh %s %d
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Sun Jul  3 13:47:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.65/1.40  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.65/1.41  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.65/1.42  
% 0.65/1.42  %-----------------------------------------------------
% 0.65/1.42  fof(s1_0_adjunction, conjecture, adjunction, file('/export/starexec/sandbox/benchmark/theBenchmark.p', s1_0_adjunction)).
% 0.65/1.42  fof(modus_ponens, axiom, modus_ponens <=> ! [_84184, _84187] : (is_a_theorem(_84184) & is_a_theorem(implies(_84184, _84187)) => is_a_theorem(_84187)), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.65/1.42  fof(and_3, axiom, and_3 <=> ! [_84380, _84383] : is_a_theorem(implies(_84380, implies(_84383, and(_84380, _84383)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', and_3)).
% 0.65/1.42  fof(hilbert_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_modus_ponens)).
% 0.65/1.42  fof(hilbert_and_3, axiom, and_3, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_and_3)).
% 0.65/1.42  fof(adjunction, axiom, adjunction <=> ! [_84715, _84718] : (is_a_theorem(_84715) & is_a_theorem(_84718) => is_a_theorem(and(_84715, _84718))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', adjunction)).
% 0.65/1.42  
% 0.65/1.42  cnf(1, plain, [adjunction], clausify(s1_0_adjunction)).
% 0.65/1.42  cnf(2, plain, [modus_ponens, -(is_a_theorem(_33303)), is_a_theorem(_33252), is_a_theorem(implies(_33252, _33303))], clausify(modus_ponens)).
% 0.65/1.42  cnf(3, plain, [and_3, -(is_a_theorem(implies(_36341, implies(_36388, and(_36341, _36388)))))], clausify(and_3)).
% 0.65/1.42  cnf(4, plain, [-(modus_ponens)], clausify(hilbert_modus_ponens)).
% 0.65/1.42  cnf(5, plain, [-(and_3)], clausify(hilbert_and_3)).
% 0.65/1.42  cnf(6, plain, [-(adjunction), -(is_a_theorem(59 ^ []))], clausify(adjunction)).
% 0.65/1.42  cnf(7, plain, [-(adjunction), -(is_a_theorem(60 ^ []))], clausify(adjunction)).
% 0.65/1.42  cnf(8, plain, [-(adjunction), is_a_theorem(and(59 ^ [], 60 ^ []))], clausify(adjunction)).
% 0.65/1.42  
% 0.65/1.42  cnf('1',plain,[adjunction],start(1)).
% 0.65/1.42  cnf('1.1',plain,[-(adjunction), -(is_a_theorem(59 ^ []))],extension(6)).
% 0.65/1.42  cnf('1.1.1',plain,[is_a_theorem(59 ^ []), modus_ponens, -(is_a_theorem(implies(60 ^ [], and(59 ^ [], 60 ^ [])))), is_a_theorem(implies(59 ^ [], implies(60 ^ [], and(59 ^ [], 60 ^ []))))],extension(2,bind([[_33252, _33303], [59 ^ [], implies(60 ^ [], and(59 ^ [], 60 ^ []))]]))).
% 0.65/1.42  cnf('1.1.1.1',plain,[-(modus_ponens)],extension(4)).
% 0.65/1.42  cnf('1.1.1.2',plain,[is_a_theorem(implies(60 ^ [], and(59 ^ [], 60 ^ []))), modus_ponens, -(is_a_theorem(and(59 ^ [], 60 ^ []))), is_a_theorem(60 ^ [])],extension(2,bind([[_33303, _33252], [and(59 ^ [], 60 ^ []), 60 ^ []]]))).
% 0.65/1.42  cnf('1.1.1.2.1',plain,[-(modus_ponens)],extension(4)).
% 0.65/1.42  cnf('1.1.1.2.2',plain,[is_a_theorem(and(59 ^ [], 60 ^ [])), -(adjunction)],extension(8)).
% 0.65/1.42  cnf('1.1.1.2.2.1',plain,[adjunction],extension(1)).
% 0.65/1.42  cnf('1.1.1.2.3',plain,[-(is_a_theorem(60 ^ [])), -(adjunction)],extension(7)).
% 0.65/1.42  cnf('1.1.1.2.3.1',plain,[adjunction],extension(1)).
% 0.65/1.42  cnf('1.1.1.3',plain,[-(is_a_theorem(implies(59 ^ [], implies(60 ^ [], and(59 ^ [], 60 ^ []))))), and_3],extension(3,bind([[_36341, _36388], [59 ^ [], 60 ^ []]]))).
% 0.65/1.42  cnf('1.1.1.3.1',plain,[-(and_3)],extension(5)).
% 0.65/1.42  %-----------------------------------------------------
% 0.65/1.42  
% 0.75/1.42  % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------