↑ 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  : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n026.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.09s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n026.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 20:05:22 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.38  % Refutation found
% 0.09/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.38  fof(f7,axiom,(
% 0.09/0.38    (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f11,axiom,(
% 0.09/0.38    (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f16,hypothesis,(
% 0.09/0.38    least_upper_bound(a,c) = c ),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f17,hypothesis,(
% 0.09/0.38    least_upper_bound(b,c) = c ),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f18,negated_conjecture,(
% 0.09/0.38    greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b) ),
% 0.09/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.38  fof(f25,plain,(
% 0.09/0.38    ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f7])).
% 0.09/0.38  fof(f29,plain,(
% 0.09/0.38    ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f11])).
% 0.09/0.38  fof(f34,plain,(
% 0.09/0.38    least_upper_bound(a,c)=c),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f16])).
% 0.09/0.38  fof(f35,plain,(
% 0.09/0.38    least_upper_bound(b,c)=c),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f17])).
% 0.09/0.38  fof(f36,plain,(
% 0.09/0.38    ~greatest_lower_bound(least_upper_bound(a,b),c)=least_upper_bound(a,b)),
% 0.09/0.38    inference(cnf_transformation,[status(thm)],[f18])).
% 0.09/0.38  fof(f37,definition,(
% 0.09/0.38    sF1_fnc=least_upper_bound(a,b)),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.09/0.38  fof(f38,definition,(
% 0.09/0.38    sF0_fnc=greatest_lower_bound(sF1_fnc,c)),
% 0.09/0.38    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.09/0.38  fof(f39,plain,(
% 0.09/0.38    ~sF0_fnc=sF1_fnc),
% 0.09/0.38    inference(definition_folding,[],[f36,f38,f37])).
% 0.09/0.38  fof(f71,plain,(
% 0.09/0.38    ![X0]: (least_upper_bound(a,least_upper_bound(b,X0))=least_upper_bound(sF1_fnc,X0))),
% 0.09/0.38    inference(paramodulation,[status(thm)],[f37,f25])).
% 0.09/0.38  fof(f239,plain,(
% 0.09/0.38    least_upper_bound(a,c)=least_upper_bound(sF1_fnc,c)),
% 0.09/0.38    inference(paramodulation,[status(thm)],[f35,f71])).
% 0.09/0.38  fof(f244,plain,(
% 0.09/0.38    c=least_upper_bound(sF1_fnc,c)),
% 0.09/0.38    inference(forward_demodulation,[status(thm)],[f34,f239])).
% 0.09/0.38  fof(f251,plain,(
% 0.09/0.38    greatest_lower_bound(sF1_fnc,c)=sF1_fnc),
% 0.09/0.38    inference(paramodulation,[status(thm)],[f244,f29])).
% 0.09/0.38  fof(f255,plain,(
% 0.09/0.38    sF0_fnc=sF1_fnc),
% 0.09/0.38    inference(forward_demodulation,[status(thm)],[f38,f251])).
% 0.09/0.38  fof(f256,plain,(
% 0.09/0.38    $false),
% 0.09/0.38    inference(forward_subsumption_resolution,[status(thm)],[f255,f39])).
% 0.09/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.40  % Elapsed time: 0.032148 seconds
% 0.09/0.40  % CPU time: 0.074306 seconds
% 0.09/0.40  % Total memory used: 3.144 MB
% 0.09/0.40  % Net memory used: 3.115 MB
%------------------------------------------------------------------------------