↑ 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  : GRP152-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 : n017.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:07 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP152-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.11/0.37  % Computer : n017.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 19:57:58 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Drodi V4.1.1
% 0.11/0.39  % Refutation found
% 0.11/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.11/0.39  fof(f5,axiom,(
% 0.11/0.39    (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.11/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39  fof(f7,axiom,(
% 0.11/0.39    (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 0.11/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39  fof(f8,axiom,(
% 0.11/0.39    (![X]: (least_upper_bound(X,X) = X ))),
% 0.11/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39  fof(f16,negated_conjecture,(
% 0.11/0.39    least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b) ),
% 0.11/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.39  fof(f21,plain,(
% 0.11/0.39    ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.11/0.39    inference(cnf_transformation,[status(thm)],[f5])).
% 0.11/0.39  fof(f23,plain,(
% 0.11/0.39    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 0.11/0.39    inference(cnf_transformation,[status(thm)],[f7])).
% 0.11/0.39  fof(f24,plain,(
% 0.11/0.39    ![X0]: (least_upper_bound(X0,X0)=X0)),
% 0.11/0.39    inference(cnf_transformation,[status(thm)],[f8])).
% 0.11/0.39  fof(f32,plain,(
% 0.11/0.39    ~least_upper_bound(b,least_upper_bound(a,b))=least_upper_bound(a,b)),
% 0.11/0.39    inference(cnf_transformation,[status(thm)],[f16])).
% 0.11/0.39  fof(f33,definition,(
% 0.11/0.39    sF1_fnc=least_upper_bound(a,b)),
% 0.11/0.39    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.11/0.39  fof(f34,definition,(
% 0.11/0.39    sF0_fnc=least_upper_bound(b,sF1_fnc)),
% 0.11/0.39    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.11/0.39  fof(f35,plain,(
% 0.11/0.39    ~sF0_fnc=sF1_fnc),
% 0.11/0.39    inference(definition_folding,[],[f32,f34,f33])).
% 0.11/0.39  fof(f48,plain,(
% 0.11/0.39    ![X0,X1]: (least_upper_bound(X0,least_upper_bound(X0,X1))=least_upper_bound(X0,X1))),
% 0.11/0.39    inference(paramodulation,[status(thm)],[f24,f23])).
% 0.11/0.39  fof(f69,plain,(
% 0.11/0.39    ![X0,X1]: (least_upper_bound(X0,least_upper_bound(X1,X0))=least_upper_bound(X0,X1))),
% 0.11/0.39    inference(paramodulation,[status(thm)],[f21,f48])).
% 0.11/0.39  fof(f102,plain,(
% 0.11/0.39    least_upper_bound(b,sF1_fnc)=least_upper_bound(b,a)),
% 0.11/0.39    inference(paramodulation,[status(thm)],[f33,f69])).
% 0.11/0.39  fof(f131,plain,(
% 0.11/0.39    sF0_fnc=least_upper_bound(b,a)),
% 0.11/0.39    inference(forward_demodulation,[status(thm)],[f34,f102])).
% 0.11/0.39  fof(f132,plain,(
% 0.11/0.39    sF1_fnc=sF0_fnc),
% 0.11/0.39    inference(backward_demodulation,[status(thm)],[f133,f33])).
% 0.11/0.39  fof(f133,plain,(
% 0.11/0.39    sF0_fnc=least_upper_bound(a,b)),
% 0.11/0.39    inference(forward_demodulation,[status(thm)],[f21,f131])).
% 0.11/0.39  fof(f150,plain,(
% 0.11/0.39    $false),
% 0.11/0.39    inference(forward_subsumption_resolution,[status(thm)],[f132,f35])).
% 0.11/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.11/0.40  % Elapsed time: 0.023522 seconds
% 0.11/0.40  % CPU time: 0.038227 seconds
% 0.11/0.40  % Total memory used: 1.174 MB
% 0.11/0.40  % Net memory used: 1.118 MB
%------------------------------------------------------------------------------