↑ 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  : LCL083-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 : n020.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 01:09:19 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL083-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.10/0.36  % Computer : n020.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 : Mon Sep 21 00:05:02 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.44  % Refutation found
% 0.10/0.44  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.44  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.44  fof(f1,axiom,(
% 0.10/0.44    (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.10/0.44    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.44  fof(f2,axiom,(
% 0.10/0.44    (![X,Y,Z,U]: (is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))) ))),
% 0.10/0.44    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.44  fof(f3,negated_conjecture,(
% 0.10/0.44    ~ is_a_theorem(implies(implies(implies(a,b),a),a)) ),
% 0.10/0.44    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.44  fof(f4,plain,(
% 0.10/0.44    ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.10/0.44    inference(miniscoping,[status(thm)],[f1])).
% 0.10/0.44  fof(f5,plain,(
% 0.10/0.44    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.10/0.44    inference(cnf_transformation,[status(thm)],[f4])).
% 0.10/0.44  fof(f6,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))))),
% 0.10/0.44    inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.44  fof(f7,plain,(
% 0.10/0.44    ~is_a_theorem(implies(implies(implies(a,b),a),a))),
% 0.10/0.44    inference(cnf_transformation,[status(thm)],[f3])).
% 0.10/0.44  fof(f8,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(implies(implies(X2,X0),implies(X3,X0))))),
% 0.10/0.44    inference(resolution,[status(thm)],[f6,f5])).
% 0.10/0.44  fof(f9,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,X1),X2))|~is_a_theorem(implies(X2,X0))|is_a_theorem(implies(X3,X0)))),
% 0.10/0.44    inference(resolution,[status(thm)],[f8,f5])).
% 0.10/0.44  fof(f11,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,X1),X2))|~is_a_theorem(implies(X2,X0))|~is_a_theorem(X3)|is_a_theorem(X0))),
% 0.10/0.44    inference(resolution,[status(thm)],[f9,f5])).
% 0.10/0.44  fof(f12,definition,(
% 0.10/0.44    ![X0,X1,X2]: (sQ0_spl <=> (~is_a_theorem(implies(implies(X0,X1),X2))|~is_a_theorem(implies(X2,X0))|is_a_theorem(X0)))),
% 0.10/0.44    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.44  fof(f13,plain,(
% 0.10/0.44    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X2))|~is_a_theorem(implies(X2,X0))|is_a_theorem(X0)|~sQ0_spl)),
% 0.10/0.44    inference(component_clause,[status(thm)],[f12])).
% 0.10/0.44  fof(f15,definition,(
% 0.10/0.44    ![X3]: (sQ1_spl <=> (~is_a_theorem(X3)))),
% 0.10/0.44    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.44  fof(f16,plain,(
% 0.10/0.44    ![X0]: (~is_a_theorem(X0)|~sQ1_spl)),
% 0.10/0.44    inference(component_clause,[status(thm)],[f15])).
% 0.10/0.44  fof(f18,plain,(
% 0.10/0.44    sQ0_spl|sQ1_spl),
% 0.10/0.44    inference(split_clause,[status(thm)],[f11,f12,f15])).
% 0.10/0.44  fof(f36,plain,(
% 0.10/0.44    ![X0,X1,X2,X3,X4]: (~is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X1,X4),X0)))|is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f13,f6])).
% 0.10/0.44  fof(f45,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))|~is_a_theorem(implies(implies(X0,X3),implies(implies(X0,X1),implies(X2,X1))))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f36,f8])).
% 0.10/0.44  fof(f46,plain,(
% 0.10/0.44    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f45,f6])).
% 0.10/0.44  fof(f48,plain,(
% 0.10/0.44    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(implies(X0,X1),X2),X1),implies(X0,X1)))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f46,f45])).
% 0.10/0.44  fof(f52,plain,(
% 0.10/0.44    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X1,X3),X1)))|is_a_theorem(implies(X0,X1))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f46,f13])).
% 0.10/0.44  fof(f69,plain,(
% 0.10/0.44    $false|~sQ1_spl),
% 0.10/0.44    inference(backward_subsumption_resolution,[status(thm)],[f6,f16])).
% 0.10/0.44  fof(f70,plain,(
% 0.10/0.44    ~sQ1_spl),
% 0.10/0.44    inference(contradiction_clause,[status(thm)],[f69])).
% 0.10/0.44  fof(f179,plain,(
% 0.10/0.44    ![X0,X1]: (is_a_theorem(implies(implies(implies(X0,X1),X0),X0))|~sQ0_spl)),
% 0.10/0.44    inference(resolution,[status(thm)],[f52,f48])).
% 0.10/0.44  fof(f191,plain,(
% 0.10/0.44    $false|~sQ0_spl),
% 0.10/0.44    inference(backward_subsumption_resolution,[status(thm)],[f7,f179])).
% 0.10/0.44  fof(f197,plain,(
% 0.10/0.44    ~sQ0_spl),
% 0.10/0.44    inference(contradiction_clause,[status(thm)],[f191])).
% 0.10/0.45  fof(f198,plain,(
% 0.10/0.45    $false),
% 0.10/0.45    inference(sat_refutation,[status(thm)],[f18,f70,f197])).
% 0.10/0.45  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.47  % Elapsed time: 0.103632 seconds
% 0.10/0.47  % CPU time: 0.540081 seconds
% 0.10/0.47  % Total memory used: 62.427 MB
% 0.10/0.47  % Net memory used: 60.785 MB
%------------------------------------------------------------------------------