↑ 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  : LCL081-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 : n009.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.17s 0.49s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL081-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45  % Computer : n009.cluster.edu
% 0.17/0.45  % Model    : x86_64 x86_64
% 0.17/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45  % Memory   : 8046.5625MB
% 0.17/0.45  % OS       : Linux 6.8.0-71-generic
% 0.17/0.45  % CPULimit : 300
% 0.17/0.45  % WCLimit  : 300
% 0.17/0.45  % DateTime : Mon Sep 21 00:04:12 UTC 2026
% 0.17/0.45  % CPUTime  : 
% 0.17/0.47  % Drodi V4.1.1
% 0.17/0.49  % Refutation found
% 0.17/0.49  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.49  % SZS output start CNFRefutation for theBenchmark
% 0.17/0.49  fof(f1,axiom,(
% 0.17/0.49    (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.17/0.49    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.49  fof(f2,axiom,(
% 0.17/0.49    (![X,Y,Z,U]: (is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))) ))),
% 0.17/0.49    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.49  fof(f3,negated_conjecture,(
% 0.17/0.49    ~ is_a_theorem(implies(a,a)) ),
% 0.17/0.49    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.49  fof(f4,plain,(
% 0.17/0.49    ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.17/0.49    inference(miniscoping,[status(thm)],[f1])).
% 0.17/0.49  fof(f5,plain,(
% 0.17/0.49    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.17/0.49    inference(cnf_transformation,[status(thm)],[f4])).
% 0.17/0.49  fof(f6,plain,(
% 0.17/0.49    ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))))),
% 0.17/0.50    inference(cnf_transformation,[status(thm)],[f2])).
% 0.17/0.50  fof(f7,plain,(
% 0.17/0.50    ~is_a_theorem(implies(a,a))),
% 0.17/0.50    inference(cnf_transformation,[status(thm)],[f3])).
% 0.17/0.50  fof(f8,plain,(
% 0.17/0.50    ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(implies(implies(X2,X0),implies(X3,X0))))),
% 0.17/0.50    inference(resolution,[status(thm)],[f6,f5])).
% 0.17/0.50  fof(f9,plain,(
% 0.17/0.50    ![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.17/0.50    inference(resolution,[status(thm)],[f8,f5])).
% 0.17/0.50  fof(f15,definition,(
% 0.17/0.50    ![X3]: (sQ1_spl <=> (~is_a_theorem(X3)))),
% 0.17/0.50    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.17/0.50  fof(f16,plain,(
% 0.17/0.50    ![X0]: (~is_a_theorem(X0)|~sQ1_spl)),
% 0.17/0.50    inference(component_clause,[status(thm)],[f15])).
% 0.17/0.50  fof(f37,plain,(
% 0.17/0.50    ![X0,X1,X2,X3,X4,X5]: (~is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X1,X4),X0)))|is_a_theorem(implies(X5,implies(implies(X0,X1),implies(X2,X1)))))),
% 0.17/0.50    inference(resolution,[status(thm)],[f9,f6])).
% 0.17/0.50  fof(f43,plain,(
% 0.17/0.50    ![X0,X1,X2,X3,X4]: (is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X2))))|~is_a_theorem(implies(implies(X1,X4),implies(implies(X1,X2),implies(X3,X2)))))),
% 0.17/0.50    inference(resolution,[status(thm)],[f37,f8])).
% 0.17/0.50  fof(f49,plain,(
% 0.17/0.50    ![X0,X1,X2,X3]: (is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))))),
% 0.17/0.50    inference(resolution,[status(thm)],[f43,f6])).
% 0.17/0.50  fof(f59,plain,(
% 0.17/0.50    ![X0,X1,X2,X3]: (~is_a_theorem(X0)|is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))))),
% 0.17/0.50    inference(resolution,[status(thm)],[f49,f5])).
% 0.17/0.50  fof(f60,definition,(
% 0.17/0.50    ![X1,X2,X3]: (sQ4_spl <=> (is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))))),
% 0.17/0.50    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.17/0.50  fof(f61,plain,(
% 0.17/0.50    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))|~sQ4_spl)),
% 0.17/0.50    inference(component_clause,[status(thm)],[f60])).
% 0.17/0.50  fof(f63,plain,(
% 0.17/0.50    sQ1_spl|sQ4_spl),
% 0.17/0.50    inference(split_clause,[status(thm)],[f59,f15,f60])).
% 0.17/0.50  fof(f64,plain,(
% 0.17/0.50    $false|~sQ1_spl),
% 0.17/0.50    inference(backward_subsumption_resolution,[status(thm)],[f6,f16])).
% 0.17/0.50  fof(f67,plain,(
% 0.17/0.50    ~sQ1_spl),
% 0.17/0.50    inference(contradiction_clause,[status(thm)],[f64])).
% 0.17/0.50  fof(f68,plain,(
% 0.17/0.50    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X0))|is_a_theorem(implies(X2,X0))|~sQ4_spl)),
% 0.17/0.50    inference(resolution,[status(thm)],[f61,f5])).
% 0.17/0.50  fof(f71,plain,(
% 0.17/0.50    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X1)))|~sQ4_spl)),
% 0.17/0.50    inference(resolution,[status(thm)],[f68,f61])).
% 0.17/0.50  fof(f83,plain,(
% 0.17/0.50    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,X1))|~sQ4_spl)),
% 0.17/0.50    inference(resolution,[status(thm)],[f71,f5])).
% 0.17/0.50  fof(f84,definition,(
% 0.17/0.50    ![X1]: (sQ5_spl <=> (is_a_theorem(implies(X1,X1))))),
% 0.17/0.50    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.17/0.50  fof(f85,plain,(
% 0.17/0.50    ![X0]: (is_a_theorem(implies(X0,X0))|~sQ5_spl)),
% 0.17/0.50    inference(component_clause,[status(thm)],[f84])).
% 0.17/0.50  fof(f87,plain,(
% 0.17/0.50    sQ1_spl|sQ5_spl|~sQ4_spl),
% 0.17/0.50    inference(split_clause,[status(thm)],[f83,f15,f84,f60])).
% 0.17/0.50  fof(f88,plain,(
% 0.17/0.50    $false|~sQ5_spl),
% 0.17/0.50    inference(backward_subsumption_resolution,[status(thm)],[f7,f85])).
% 0.17/0.50  fof(f89,plain,(
% 0.17/0.50    ~sQ5_spl),
% 0.17/0.50    inference(contradiction_clause,[status(thm)],[f88])).
% 0.17/0.50  fof(f90,plain,(
% 0.17/0.50    $false),
% 0.17/0.50    inference(sat_refutation,[status(thm)],[f63,f67,f87,f89])).
% 0.17/0.50  % SZS output end CNFRefutation for theBenchmark.p
% 0.25/0.56  % Elapsed time: 0.101707 seconds
% 0.25/0.56  % CPU time: 0.137168 seconds
% 0.25/0.56  % Total memory used: 11.233 MB
% 0.25/0.56  % Net memory used: 11.112 MB
%------------------------------------------------------------------------------