↑ 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  : LCL086-1 : 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 : 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:20 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL086-1 : 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.08/0.35  % Computer : n020.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 00:05:32 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.40  fof(f1,axiom,(
% 0.13/0.40    (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f2,axiom,(
% 0.13/0.40    (![P,Q,R,S,T]: (is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(T,implies(implies(S,P),implies(R,P))))) ))),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f3,negated_conjecture,(
% 0.13/0.40    ~ is_a_theorem(implies(a,a)) ),
% 0.13/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.40  fof(f4,plain,(
% 0.13/0.40    ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.13/0.40    inference(miniscoping,[status(thm)],[f1])).
% 0.13/0.40  fof(f5,plain,(
% 0.13/0.40    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f4])).
% 0.13/0.40  fof(f6,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4]: (is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f2])).
% 0.13/0.40  fof(f7,plain,(
% 0.13/0.40    ~is_a_theorem(implies(a,a))),
% 0.13/0.40    inference(cnf_transformation,[status(thm)],[f3])).
% 0.13/0.40  fof(f8,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4]: (~is_a_theorem(implies(implies(X0,X1),implies(X2,X3)))|is_a_theorem(implies(X4,implies(implies(X3,X0),implies(X2,X0)))))),
% 0.13/0.40    inference(resolution,[status(thm)],[f6,f5])).
% 0.13/0.40  fof(f9,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))))),
% 0.13/0.40    inference(resolution,[status(thm)],[f8,f6])).
% 0.13/0.40  fof(f11,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4,X5]: (~is_a_theorem(X0)|is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))))),
% 0.13/0.40    inference(resolution,[status(thm)],[f9,f5])).
% 0.13/0.40  fof(f12,definition,(
% 0.13/0.40    ![X0]: (sQ0_spl <=> (~is_a_theorem(X0)))),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f13,plain,(
% 0.13/0.40    ![X0]: (~is_a_theorem(X0)|~sQ0_spl)),
% 0.13/0.40    inference(component_clause,[status(thm)],[f12])).
% 0.13/0.40  fof(f15,definition,(
% 0.13/0.40    ![X1,X2,X3,X4,X5]: (sQ1_spl <=> (is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))))),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f16,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4]: (is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3))))|~sQ1_spl)),
% 0.13/0.40    inference(component_clause,[status(thm)],[f15])).
% 0.13/0.40  fof(f18,plain,(
% 0.13/0.40    sQ0_spl|sQ1_spl),
% 0.13/0.40    inference(split_clause,[status(thm)],[f11,f12,f15])).
% 0.13/0.40  fof(f19,plain,(
% 0.13/0.40    $false|~sQ0_spl),
% 0.13/0.40    inference(backward_subsumption_resolution,[status(thm)],[f6,f13])).
% 0.13/0.40  fof(f21,plain,(
% 0.13/0.40    ~sQ0_spl),
% 0.13/0.40    inference(contradiction_clause,[status(thm)],[f19])).
% 0.13/0.40  fof(f22,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4]: (~is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))|is_a_theorem(implies(X4,implies(X1,X3)))|~sQ1_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f16,f5])).
% 0.13/0.40  fof(f27,plain,(
% 0.13/0.40    ![X0,X1,X2,X3,X4]: (~is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))|~is_a_theorem(X4)|is_a_theorem(implies(X1,X3))|~sQ1_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f22,f5])).
% 0.13/0.40  fof(f28,definition,(
% 0.13/0.40    ![X0,X1,X2,X3]: (sQ2_spl <=> (~is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))|is_a_theorem(implies(X1,X3))))),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f29,plain,(
% 0.13/0.40    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))|is_a_theorem(implies(X1,X3))|~sQ2_spl)),
% 0.13/0.40    inference(component_clause,[status(thm)],[f28])).
% 0.13/0.40  fof(f31,plain,(
% 0.13/0.40    sQ2_spl|sQ0_spl|~sQ1_spl),
% 0.13/0.40    inference(split_clause,[status(thm)],[f27,f28,f12,f15])).
% 0.13/0.40  fof(f32,plain,(
% 0.13/0.40    ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(X1,implies(X0,X1))))|~sQ2_spl|~sQ1_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f29,f16])).
% 0.13/0.40  fof(f35,plain,(
% 0.13/0.40    ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1))))|~sQ2_spl|~sQ1_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f32,f8])).
% 0.13/0.40  fof(f85,plain,(
% 0.13/0.40    ![X0,X1]: (is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X1,X0)))|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f35,f29])).
% 0.13/0.40  fof(f92,plain,(
% 0.13/0.40    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0)))|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f85,f29])).
% 0.13/0.40  fof(f96,plain,(
% 0.13/0.40    ![X0,X1,X2,X3]: (is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1))))|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f92,f8])).
% 0.13/0.40  fof(f129,plain,(
% 0.13/0.40    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f96,f29])).
% 0.13/0.40  fof(f140,plain,(
% 0.13/0.40    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X0))|is_a_theorem(implies(X2,X0))|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f129,f5])).
% 0.13/0.40  fof(f144,plain,(
% 0.13/0.40    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X0))|~is_a_theorem(X2)|is_a_theorem(X0)|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f140,f5])).
% 0.13/0.40  fof(f145,definition,(
% 0.13/0.40    ![X0,X1]: (sQ12_spl <=> (~is_a_theorem(implies(implies(X0,X1),X0))|is_a_theorem(X0)))),
% 0.13/0.40    introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition])).
% 0.13/0.40  fof(f146,plain,(
% 0.13/0.40    ![X0,X1]: (~is_a_theorem(implies(implies(X0,X1),X0))|is_a_theorem(X0)|~sQ12_spl)),
% 0.13/0.40    inference(component_clause,[status(thm)],[f145])).
% 0.13/0.40  fof(f148,plain,(
% 0.13/0.40    sQ12_spl|sQ0_spl|~sQ1_spl|~sQ2_spl),
% 0.13/0.40    inference(split_clause,[status(thm)],[f144,f145,f12,f15,f28])).
% 0.13/0.40  fof(f151,plain,(
% 0.13/0.40    ![X0]: (is_a_theorem(implies(X0,X0))|~sQ12_spl|~sQ1_spl|~sQ2_spl)),
% 0.13/0.40    inference(resolution,[status(thm)],[f146,f129])).
% 0.13/0.40  fof(f181,plain,(
% 0.13/0.40    $false|~sQ12_spl|~sQ1_spl|~sQ2_spl),
% 0.13/0.40    inference(forward_subsumption_resolution,[status(thm)],[f7,f151])).
% 0.13/0.40  fof(f182,plain,(
% 0.13/0.40    ~sQ12_spl|~sQ1_spl|~sQ2_spl),
% 0.13/0.40    inference(contradiction_clause,[status(thm)],[f181])).
% 0.13/0.40  fof(f183,plain,(
% 0.13/0.40    $false),
% 0.13/0.40    inference(sat_refutation,[status(thm)],[f18,f21,f31,f148,f182])).
% 0.13/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.42  % Elapsed time: 0.058865 seconds
% 0.13/0.42  % CPU time: 0.268073 seconds
% 0.13/0.42  % Total memory used: 29.409 MB
% 0.13/0.42  % Net memory used: 28.953 MB
%------------------------------------------------------------------------------