↑ Up

Drodi-SAT---4.1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : GRP142-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:36:06 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.54s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP142-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.52  % Computer : n010.cluster.edu
% 0.10/0.52  % Model    : x86_64 x86_64
% 0.10/0.52  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52  % Memory   : 8046.5625MB
% 0.10/0.52  % OS       : Linux 6.8.0-71-generic
% 0.10/0.52  % CPULimit : 300
% 0.10/0.52  % WCLimit  : 300
% 0.10/0.52  % DateTime : Sun Sep 20 20:02:40 UTC 2026
% 0.10/0.53  % CPUTime  : 
% 0.10/0.53  % Drodi V4.1.1
% 0.10/0.54  % Refutation found
% 0.10/0.54  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.54  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.54  fof(f4,axiom,(
% 0.10/0.54    (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.10/0.54    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.54  fof(f5,axiom,(
% 0.10/0.54    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.10/0.54    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.54  fof(f10,axiom,(
% 0.10/0.54    (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.10/0.54    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.54  fof(f16,negated_conjecture,(
% 0.10/0.54    least_upper_bound(greatest_lower_bound(a,b),a) != a ),
% 0.10/0.54    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.54  fof(f20,plain,(
% 0.10/0.54    ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.10/0.54    inference(cnf_transformation,[status(thm)],[f4])).
% 0.10/0.54  fof(f21,plain,(
% 0.10/0.54    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.10/0.54    inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.54  fof(f26,plain,(
% 0.10/0.54    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.10/0.54    inference(cnf_transformation,[status(thm)],[f10])).
% 0.10/0.54  fof(f32,plain,(
% 0.10/0.54    ~least_upper_bound(greatest_lower_bound(a,b),a)=a),
% 0.10/0.54    inference(cnf_transformation,[status(thm)],[f16])).
% 0.10/0.54  fof(f33,definition,(
% 0.10/0.54    sF1_fnc=greatest_lower_bound(a,b)),
% 0.10/0.54    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.10/0.54  fof(f34,definition,(
% 0.10/0.54    sF0_fnc=least_upper_bound(sF1_fnc,a)),
% 0.10/0.54    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.10/0.54  fof(f35,plain,(
% 0.10/0.54    ~sF0_fnc=a),
% 0.10/0.54    inference(definition_folding,[],[f32,f34,f33])).
% 0.10/0.54  fof(f36,plain,(
% 0.10/0.54    sF1_fnc=greatest_lower_bound(b,a)),
% 0.10/0.54    inference(forward_demodulation,[status(thm)],[f20,f33])).
% 0.10/0.54  fof(f37,plain,(
% 0.10/0.54    sF0_fnc=least_upper_bound(a,sF1_fnc)),
% 0.10/0.54    inference(forward_demodulation,[status(thm)],[f21,f34])).
% 0.10/0.54  fof(f50,plain,(
% 0.10/0.54    ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X1,X0))=X0)),
% 0.10/0.54    inference(paramodulation,[status(thm)],[f20,f26])).
% 0.10/0.54  fof(f54,plain,(
% 0.10/0.54    least_upper_bound(a,sF1_fnc)=a),
% 0.10/0.54    inference(paramodulation,[status(thm)],[f36,f50])).
% 0.10/0.54  fof(f62,plain,(
% 0.10/0.54    sF0_fnc=a),
% 0.10/0.54    inference(backward_demodulation,[status(thm)],[f54,f37])).
% 0.10/0.54  fof(f64,plain,(
% 0.10/0.54    $false),
% 0.10/0.54    inference(forward_subsumption_resolution,[status(thm)],[f62,f35])).
% 0.10/0.54  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.57  % Elapsed time: 0.035559 seconds
% 0.14/0.57  % CPU time: 0.034004 seconds
% 0.14/0.57  % Total memory used: 448.848 KB
% 0.14/0.57  % Net memory used: 427.760 KB
%------------------------------------------------------------------------------