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

% Computer : n003.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 03:18:54 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN075-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.36  % Computer : n003.cluster.edu
% 0.11/10.36  % Model    : x86_64 x86_64
% 0.11/10.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.36  % Memory   : 8046.5625MB
% 0.11/10.36  % OS       : Linux 6.8.0-71-generic
% 0.11/10.37  % CPULimit : 300
% 0.11/10.37  % WCLimit  : 300
% 0.11/10.37  % DateTime : Mon Sep 21 10:43:57 UTC 2026
% 0.11/10.37  % CPUTime  : 
% 0.11/10.38  % Drodi V4.1.1
% 0.11/10.40  % Refutation found
% 0.11/10.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/10.40  % SZS output start CNFRefutation for theBenchmark
% 0.11/10.40  fof(f1,axiom,(
% 0.11/10.40    (![X,Y]: (( ~ big_f(X,Y)| X = a ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f3,axiom,(
% 0.11/10.40    (![X,Y]: (( X != a| Y != b| big_f(X,Y) ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f4,negated_conjecture,(
% 0.11/10.40    (![Y,X]: (( ~ big_f(Y,f(X))| Y != g(X)| f(X) = X ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f6,negated_conjecture,(
% 0.11/10.40    (![Y,X]: (( Y != g(X)| big_f(Y,f(X))| f(X) = X ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f9,negated_conjecture,(
% 0.11/10.40    (![X,Z]: (( f(X) != X| big_f(h(X,Z),f(X))| h(X,Z) = Z ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f10,negated_conjecture,(
% 0.11/10.40    (![X,Z]: (( f(X) != X| h(X,Z) != Z| ~ big_f(h(X,Z),f(X)) ) ))),
% 0.11/10.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/10.40  fof(f11,plain,(
% 0.11/10.40    ![X]: ((![Y]: ~big_f(X,Y))|X=a)),
% 0.11/10.40    inference(miniscoping,[status(thm)],[f1])).
% 0.11/10.40  fof(f12,plain,(
% 0.11/10.40    ![X0,X1]: (~big_f(X0,X1)|X0=a)),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f11])).
% 0.11/10.40  fof(f15,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=a|~X1=b|big_f(X0,X1))),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f3])).
% 0.11/10.40  fof(f16,plain,(
% 0.11/10.40    ![X]: ((![Y]: (~big_f(Y,f(X))|~Y=g(X)))|f(X)=X)),
% 0.11/10.40    inference(miniscoping,[status(thm)],[f4])).
% 0.11/10.40  fof(f17,plain,(
% 0.11/10.40    ![X0,X1]: (~big_f(X0,f(X1))|~X0=g(X1)|f(X1)=X1)),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f16])).
% 0.11/10.40  fof(f20,plain,(
% 0.11/10.40    ![X]: ((![Y]: (~Y=g(X)|big_f(Y,f(X))))|f(X)=X)),
% 0.11/10.40    inference(miniscoping,[status(thm)],[f6])).
% 0.11/10.40  fof(f21,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=g(X1)|big_f(X0,f(X1))|f(X1)=X1)),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f20])).
% 0.11/10.40  fof(f26,plain,(
% 0.11/10.40    ![X0,X1]: (~f(X0)=X0|big_f(h(X0,X1),f(X0))|h(X0,X1)=X1)),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f9])).
% 0.11/10.40  fof(f27,plain,(
% 0.11/10.40    ![X0,X1]: (~f(X0)=X0|~h(X0,X1)=X1|~big_f(h(X0,X1),f(X0)))),
% 0.11/10.40    inference(cnf_transformation,[status(thm)],[f10])).
% 0.11/10.40  fof(f28,plain,(
% 0.11/10.40    big_f(a,b)),
% 0.11/10.40    inference(destructive_equality_resolution,[status(thm)],[f15])).
% 0.11/10.40  fof(f29,plain,(
% 0.11/10.40    ![X0]: (~big_f(g(X0),f(X0))|f(X0)=X0)),
% 0.11/10.40    inference(destructive_equality_resolution,[status(thm)],[f17])).
% 0.11/10.40  fof(f30,plain,(
% 0.11/10.40    ![X1]: (big_f(g(X1),f(X1))|f(X1)=X1)),
% 0.11/10.40    inference(destructive_equality_resolution,[status(thm)],[f21])).
% 0.11/10.40  fof(f32,plain,(
% 0.11/10.40    ![X0]: (f(X0)=X0)),
% 0.11/10.40    inference(forward_subsumption_resolution,[status(thm)],[f30,f29])).
% 0.11/10.40  fof(f39,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=X0|big_f(h(X0,X1),f(X0))|h(X0,X1)=X1)),
% 0.11/10.40    inference(forward_demodulation,[status(thm)],[f32,f26])).
% 0.11/10.40  fof(f40,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=X0|big_f(h(X0,X1),X0)|h(X0,X1)=X1)),
% 0.11/10.40    inference(forward_demodulation,[status(thm)],[f32,f39])).
% 0.11/10.40  fof(f41,plain,(
% 0.11/10.40    ![X0,X1]: (big_f(h(X0,X1),X0)|h(X0,X1)=X1)),
% 0.11/10.40    inference(trivial_equality_resolution,[status(thm)],[f40])).
% 0.11/10.40  fof(f42,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=X0|~h(X0,X1)=X1|~big_f(h(X0,X1),f(X0)))),
% 0.11/10.40    inference(forward_demodulation,[status(thm)],[f32,f27])).
% 0.11/10.40  fof(f43,plain,(
% 0.11/10.40    ![X0,X1]: (~X0=X0|~h(X0,X1)=X1|~big_f(h(X0,X1),X0))),
% 0.11/10.40    inference(forward_demodulation,[status(thm)],[f32,f42])).
% 0.11/10.40  fof(f44,plain,(
% 0.11/10.40    ![X0,X1]: (~h(X0,X1)=X1|~big_f(h(X0,X1),X0))),
% 0.11/10.40    inference(trivial_equality_resolution,[status(thm)],[f43])).
% 0.11/10.40  fof(f47,plain,(
% 0.11/10.40    ![X0,X1]: (h(X0,X1)=a|h(X0,X1)=X1)),
% 0.11/10.40    inference(resolution,[status(thm)],[f12,f41])).
% 0.11/10.40  fof(f50,plain,(
% 0.11/10.40    ![X0,X1]: (~a=X0|h(X1,X0)=X0)),
% 0.11/10.40    inference(equality_factoring,[status(thm)],[f47])).
% 0.11/10.40  fof(f53,plain,(
% 0.11/10.40    ![X0]: (h(X0,a)=a)),
% 0.11/10.40    inference(destructive_equality_resolution,[status(thm)],[f50])).
% 0.11/10.40  fof(f80,plain,(
% 0.11/10.40    ![X0]: (~h(X0,a)=a|~big_f(a,X0))),
% 0.11/10.40    inference(paramodulation,[status(thm)],[f53,f44])).
% 0.11/10.40  fof(f81,plain,(
% 0.11/10.40    ![X0]: (~a=a|~big_f(a,X0))),
% 0.11/10.40    inference(forward_demodulation,[status(thm)],[f53,f80])).
% 0.11/10.40  fof(f83,plain,(
% 0.11/10.40    ![X0]: (~big_f(a,X0))),
% 0.11/10.40    inference(trivial_equality_resolution,[status(thm)],[f81])).
% 0.11/10.40  fof(f84,plain,(
% 0.11/10.40    $false),
% 0.11/10.40    inference(backward_subsumption_resolution,[status(thm)],[f28,f83])).
% 0.11/10.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/10.42  % Elapsed time: 0.047116 seconds
% 0.14/10.42  % CPU time: 0.134465 seconds
% 0.14/10.42  % Total memory used: 64.894 MB
% 0.14/10.42  % Net memory used: 64.482 MB
%------------------------------------------------------------------------------