TSTP Solution File: SWV005-1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n002.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  : 300s
% DateTime : Wed May 31 12:40:26 EDT 2023

% Result   : Unsatisfiable 0.16s 0.32s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n002.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue May 30 11:59:28 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.5.1
% 0.16/0.32  % Refutation found
% 0.16/0.32  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.32  % SZS output start CNFRefutation for theBenchmark
% 0.16/0.32  fof(f8,axiom,(
% 0.16/0.32    (![X,Y]: (( less_than(X,Y)| less_than(Y,X)| X = Y ) ))),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f9,axiom,(
% 0.16/0.32    (![X]: (~ less_than(X,X) ))),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f10,axiom,(
% 0.16/0.32    (![X,Y]: (( ~ less_than(X,Y)| ~ less_than(Y,X) ) ))),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f13,negated_conjecture,(
% 0.16/0.32    ~ less_than(n,k) ),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f14,negated_conjecture,(
% 0.16/0.32    ~ less_than(k,l) ),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f17,negated_conjecture,(
% 0.16/0.32    less_than(one,l) ),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f18,negated_conjecture,(
% 0.16/0.32    less_than(a(k),a(predecessor(l))) ),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f20,negated_conjecture,(
% 0.16/0.32    (![X]: (( less_than(X,l)| less_than(n,X)| ~ less_than(one,l)| ~ less_than(a(X),a(predecessor(l))) ) ))),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f30,plain,(
% 0.16/0.32    ![X0,X1]: (less_than(X0,X1)|less_than(X1,X0)|X0=X1)),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f8])).
% 0.16/0.32  fof(f31,plain,(
% 0.16/0.32    ![X0]: (~less_than(X0,X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f9])).
% 0.16/0.32  fof(f32,plain,(
% 0.16/0.32    ![X0,X1]: (~less_than(X0,X1)|~less_than(X1,X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f10])).
% 0.16/0.32  fof(f37,plain,(
% 0.16/0.32    ~less_than(n,k)),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f13])).
% 0.16/0.32  fof(f38,plain,(
% 0.16/0.32    ~less_than(k,l)),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f14])).
% 0.16/0.32  fof(f41,plain,(
% 0.16/0.32    less_than(one,l)),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f17])).
% 0.16/0.32  fof(f42,plain,(
% 0.16/0.32    less_than(a(k),a(predecessor(l)))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f18])).
% 0.16/0.32  fof(f44,plain,(
% 0.16/0.32    ![X0]: (less_than(X0,l)|less_than(n,X0)|~less_than(one,l)|~less_than(a(X0),a(predecessor(l))))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f20])).
% 0.16/0.32  fof(f46,plain,(
% 0.16/0.32    spl0_0 <=> less_than(X0,l)|less_than(n,X0)|~less_than(a(X0),a(predecessor(l)))),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f47,plain,(
% 0.16/0.32    ![X0]: (less_than(X0,l)|less_than(n,X0)|~less_than(a(X0),a(predecessor(l)))|~spl0_0)),
% 0.16/0.32    inference(component_clause,[status(thm)],[f46])).
% 0.16/0.32  fof(f49,plain,(
% 0.16/0.32    spl0_1 <=> less_than(one,l)),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f52,plain,(
% 0.16/0.32    spl0_0|~spl0_1),
% 0.16/0.32    inference(split_clause,[status(thm)],[f44,f46,f49])).
% 0.16/0.32  fof(f69,plain,(
% 0.16/0.32    ~less_than(l,one)),
% 0.16/0.32    inference(resolution,[status(thm)],[f32,f41])).
% 0.16/0.32  fof(f104,plain,(
% 0.16/0.32    spl0_8 <=> one=l),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f105,plain,(
% 0.16/0.32    one=l|~spl0_8),
% 0.16/0.32    inference(component_clause,[status(thm)],[f104])).
% 0.16/0.32  fof(f107,plain,(
% 0.16/0.32    less_than(one,l)|one=l),
% 0.16/0.32    inference(resolution,[status(thm)],[f69,f30])).
% 0.16/0.32  fof(f108,plain,(
% 0.16/0.32    spl0_1|spl0_8),
% 0.16/0.32    inference(split_clause,[status(thm)],[f107,f49,f104])).
% 0.16/0.32  fof(f159,plain,(
% 0.16/0.32    less_than(l,l)|~spl0_8),
% 0.16/0.32    inference(backward_demodulation,[status(thm)],[f105,f41])).
% 0.16/0.32  fof(f160,plain,(
% 0.16/0.32    $false|~spl0_8),
% 0.16/0.32    inference(forward_subsumption_resolution,[status(thm)],[f159,f31])).
% 0.16/0.32  fof(f161,plain,(
% 0.16/0.32    ~spl0_8),
% 0.16/0.32    inference(contradiction_clause,[status(thm)],[f160])).
% 0.16/0.32  fof(f168,plain,(
% 0.16/0.32    spl0_13 <=> less_than(k,l)),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f169,plain,(
% 0.16/0.32    less_than(k,l)|~spl0_13),
% 0.16/0.32    inference(component_clause,[status(thm)],[f168])).
% 0.16/0.32  fof(f171,plain,(
% 0.16/0.32    spl0_14 <=> less_than(n,k)),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f172,plain,(
% 0.16/0.32    less_than(n,k)|~spl0_14),
% 0.16/0.32    inference(component_clause,[status(thm)],[f171])).
% 0.16/0.32  fof(f174,plain,(
% 0.16/0.32    less_than(k,l)|less_than(n,k)|~spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f47,f42])).
% 0.16/0.32  fof(f175,plain,(
% 0.16/0.32    spl0_13|spl0_14|~spl0_0),
% 0.16/0.32    inference(split_clause,[status(thm)],[f174,f168,f171,f46])).
% 0.16/0.32  fof(f177,plain,(
% 0.16/0.32    $false|~spl0_13),
% 0.16/0.32    inference(forward_subsumption_resolution,[status(thm)],[f169,f38])).
% 0.16/0.32  fof(f178,plain,(
% 0.16/0.32    ~spl0_13),
% 0.16/0.32    inference(contradiction_clause,[status(thm)],[f177])).
% 0.16/0.32  fof(f179,plain,(
% 0.16/0.54    $false|~spl0_14),
% 0.16/0.54    inference(forward_subsumption_resolution,[status(thm)],[f172,f37])).
% 0.16/0.54  fof(f180,plain,(
% 0.16/0.54    ~spl0_14),
% 0.16/0.54    inference(contradiction_clause,[status(thm)],[f179])).
% 0.16/0.54  fof(f181,plain,(
% 0.16/0.54    $false),
% 0.16/0.54    inference(sat_refutation,[status(thm)],[f52,f108,f161,f175,f178,f180])).
% 0.16/0.54  % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.54  % Elapsed time: 0.012257 seconds
% 0.16/0.54  % CPU time: 0.014280 seconds
% 0.16/0.54  % Memory used: 3.669 MB
%------------------------------------------------------------------------------