↑ 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  : GRP526-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n019.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:46 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP526-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n019.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 20:16:07 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.38  % Refutation found
% 0.10/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.38  fof(f1,axiom,(
% 0.10/0.38    (![A,B,C]: (divide(A,divide(divide(A,B),divide(C,B))) = C ))),
% 0.10/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38  fof(f2,axiom,(
% 0.10/0.38    (![A,B,C]: (multiply(A,B) = divide(A,divide(divide(C,C),B)) ))),
% 0.10/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38  fof(f3,axiom,(
% 0.10/0.38    (![A,B]: (inverse(A) = divide(divide(B,B),A) ))),
% 0.10/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38  fof(f4,negated_conjecture,(
% 0.10/0.38    multiply(multiply(inverse(b2),b2),a2) != a2 ),
% 0.10/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.38  fof(f5,plain,(
% 0.10/0.38    ![X0,X1,X2]: (divide(X0,divide(divide(X0,X1),divide(X2,X1)))=X2)),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f1])).
% 0.10/0.38  fof(f6,plain,(
% 0.10/0.38    ![X0,X1,X2]: (multiply(X0,X1)=divide(X0,divide(divide(X2,X2),X1)))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.38  fof(f7,plain,(
% 0.10/0.38    ![X0,X1]: (inverse(X0)=divide(divide(X1,X1),X0))),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f3])).
% 0.10/0.38  fof(f8,plain,(
% 0.10/0.38    ~multiply(multiply(inverse(b2),b2),a2)=a2),
% 0.10/0.38    inference(cnf_transformation,[status(thm)],[f4])).
% 0.10/0.38  fof(f9,definition,(
% 0.10/0.38    sF2_fnc=inverse(b2)),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition])).
% 0.10/0.38  fof(f10,definition,(
% 0.10/0.38    sF1_fnc=multiply(sF2_fnc,b2)),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.10/0.38  fof(f11,definition,(
% 0.10/0.38    sF0_fnc=multiply(sF1_fnc,a2)),
% 0.10/0.38    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.10/0.38  fof(f12,plain,(
% 0.10/0.38    ~sF0_fnc=a2),
% 0.10/0.38    inference(definition_folding,[],[f8,f11,f10,f9])).
% 0.10/0.38  fof(f13,plain,(
% 0.10/0.38    ![X0,X1]: (multiply(X0,X1)=divide(X0,inverse(X1)))),
% 0.10/0.38    inference(backward_demodulation,[status(thm)],[f7,f6])).
% 0.10/0.38  fof(f16,plain,(
% 0.10/0.38    ![X0]: (multiply(X0,b2)=divide(X0,sF2_fnc))),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f9,f13])).
% 0.10/0.38  fof(f19,plain,(
% 0.10/0.38    sF1_fnc=divide(sF2_fnc,sF2_fnc)),
% 0.10/0.38    inference(backward_demodulation,[status(thm)],[f16,f10])).
% 0.10/0.38  fof(f21,plain,(
% 0.10/0.38    ![X0,X1]: (divide(X0,inverse(divide(X1,X0)))=X1)),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f7,f5])).
% 0.10/0.38  fof(f31,plain,(
% 0.10/0.38    ![X0,X1]: (multiply(X0,divide(X1,X0))=X1)),
% 0.10/0.38    inference(forward_demodulation,[status(thm)],[f13,f21])).
% 0.10/0.38  fof(f39,plain,(
% 0.10/0.38    ![X0]: (inverse(X0)=divide(sF1_fnc,X0))),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f19,f7])).
% 0.10/0.38  fof(f43,plain,(
% 0.10/0.38    ![X0,X1]: (multiply(X0,inverse(X0))=divide(X1,X1))),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f7,f31])).
% 0.10/0.38  fof(f50,plain,(
% 0.10/0.38    ![X0]: (multiply(X0,inverse(X0))=sF1_fnc)),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f39,f31])).
% 0.10/0.38  fof(f57,plain,(
% 0.10/0.38    ![X0]: (sF1_fnc=divide(X0,X0))),
% 0.10/0.38    inference(backward_demodulation,[status(thm)],[f50,f43])).
% 0.10/0.38  fof(f68,plain,(
% 0.10/0.38    ![X0]: (divide(X0,sF1_fnc)=X0)),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f57,f5])).
% 0.10/0.38  fof(f86,plain,(
% 0.10/0.38    ![X0]: (multiply(sF1_fnc,X0)=X0)),
% 0.10/0.38    inference(paramodulation,[status(thm)],[f68,f31])).
% 0.10/0.38  fof(f89,plain,(
% 0.10/0.38    sF0_fnc=a2),
% 0.10/0.38    inference(backward_demodulation,[status(thm)],[f86,f11])).
% 0.10/0.38  fof(f93,plain,(
% 0.10/0.38    $false),
% 0.10/0.38    inference(forward_subsumption_resolution,[status(thm)],[f89,f12])).
% 0.10/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.40  % Elapsed time: 0.025676 seconds
% 0.10/0.40  % CPU time: 0.044801 seconds
% 0.10/0.40  % Total memory used: 1.838 MB
% 0.10/0.40  % Net memory used: 1.802 MB
%------------------------------------------------------------------------------