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

% Computer : n014.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:07:45 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36  % Computer : n014.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Mon Sep 21 13:56:50 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.15/0.37  % Drodi V4.1.1
% 0.15/0.39  % Refutation found
% 0.15/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.15/0.39  fof(f15,axiom,(
% 0.15/0.39    (![X,Y]: (( there_exists(f1(X,Y))| X = Y ) ))),
% 0.15/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.39  fof(f16,axiom,(
% 0.15/0.39    (![X,Y]: (( X = f1(X,Y)| Y = f1(X,Y)| X = Y ) ))),
% 0.15/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.39  fof(f18,hypothesis,(
% 0.15/0.39    (![Z]: (( ~ there_exists(Z)| a != Z| b = Z ) ))),
% 0.15/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.39  fof(f19,hypothesis,(
% 0.15/0.39    (![Z]: (( ~ there_exists(Z)| a = Z| b != Z ) ))),
% 0.15/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.39  fof(f20,negated_conjecture,(
% 0.15/0.39    a != b ),
% 0.15/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.39  fof(f39,plain,(
% 0.15/0.39    ![X0,X1]: (there_exists(f1(X0,X1))|X0=X1)),
% 0.15/0.39    inference(cnf_transformation,[status(thm)],[f15])).
% 0.15/0.39  fof(f40,plain,(
% 0.15/0.39    ![X0,X1]: (X0=f1(X0,X1)|X1=f1(X0,X1)|X0=X1)),
% 0.15/0.39    inference(cnf_transformation,[status(thm)],[f16])).
% 0.15/0.39  fof(f42,plain,(
% 0.15/0.39    ![X0]: (~there_exists(X0)|~a=X0|b=X0)),
% 0.15/0.39    inference(cnf_transformation,[status(thm)],[f18])).
% 0.15/0.39  fof(f43,plain,(
% 0.15/0.39    ![X0]: (~there_exists(X0)|a=X0|~b=X0)),
% 0.15/0.39    inference(cnf_transformation,[status(thm)],[f19])).
% 0.15/0.39  fof(f44,plain,(
% 0.15/0.39    ~a=b),
% 0.15/0.39    inference(cnf_transformation,[status(thm)],[f20])).
% 0.15/0.39  fof(f48,plain,(
% 0.15/0.39    ~there_exists(a)|b=a),
% 0.15/0.39    inference(destructive_equality_resolution,[status(thm)],[f42])).
% 0.15/0.39  fof(f49,plain,(
% 0.15/0.39    ~there_exists(b)|a=b),
% 0.15/0.39    inference(destructive_equality_resolution,[status(thm)],[f43])).
% 0.15/0.39  fof(f50,plain,(
% 0.15/0.39    ~there_exists(a)),
% 0.15/0.39    inference(forward_subsumption_resolution,[status(thm)],[f48,f44])).
% 0.15/0.39  fof(f51,plain,(
% 0.15/0.39    ~there_exists(b)),
% 0.15/0.39    inference(forward_subsumption_resolution,[status(thm)],[f49,f44])).
% 0.15/0.39  fof(f88,plain,(
% 0.15/0.39    ![X0,X1]: (there_exists(X0)|X0=X1|X1=f1(X0,X1)|X0=X1)),
% 0.15/0.39    inference(paramodulation,[status(thm)],[f40,f39])).
% 0.15/0.39  fof(f92,plain,(
% 0.15/0.39    ![X0,X1]: (there_exists(X0)|X0=X1|X1=f1(X0,X1))),
% 0.15/0.39    inference(duplicate_literals_removal,[status(thm)],[f88])).
% 0.15/0.39  fof(f99,plain,(
% 0.15/0.39    ![X0]: (b=X0|X0=f1(b,X0))),
% 0.15/0.39    inference(resolution,[status(thm)],[f92,f51])).
% 0.15/0.40  fof(f108,plain,(
% 0.15/0.40    ![X0]: (there_exists(X0)|b=X0|b=X0)),
% 0.15/0.40    inference(paramodulation,[status(thm)],[f99,f39])).
% 0.15/0.40  fof(f122,plain,(
% 0.15/0.40    ![X0]: (there_exists(X0)|b=X0)),
% 0.15/0.40    inference(duplicate_literals_removal,[status(thm)],[f108])).
% 0.15/0.40  fof(f151,plain,(
% 0.15/0.40    b=a),
% 0.15/0.40    inference(resolution,[status(thm)],[f122,f50])).
% 0.15/0.40  fof(f153,plain,(
% 0.15/0.40    $false),
% 0.15/0.40    inference(forward_subsumption_resolution,[status(thm)],[f151,f44])).
% 0.15/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.42  % Elapsed time: 0.046484 seconds
% 0.15/0.42  % CPU time: 0.158023 seconds
% 0.15/0.42  % Total memory used: 101.869 MB
% 0.15/0.42  % Net memory used: 101.508 MB
%------------------------------------------------------------------------------