TSTP Solution File: LCL039-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : LCL039-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:26:12 EDT 2024

% Result   : Unsatisfiable 9.94s 1.64s
% Output   : CNFRefutation 9.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : LCL039-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 20:22:40 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 9.94/1.64  % Refutation found
% 9.94/1.64  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 9.94/1.64  % SZS output start CNFRefutation for theBenchmark
% 9.94/1.64  fof(f1,axiom,(
% 9.94/1.64    (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f2,axiom,(
% 9.94/1.64    (![X,Y]: (is_a_theorem(implies(X,implies(Y,X))) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f3,axiom,(
% 9.94/1.64    (![X,Y,Z]: (is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f4,axiom,(
% 9.94/1.64    (![X,Y]: (is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f5,axiom,(
% 9.94/1.64    (![X,Y]: (is_a_theorem(implies(necessary(implies(X,Y)),implies(necessary(X),necessary(Y)))) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f6,axiom,(
% 9.94/1.64    (![X]: (is_a_theorem(implies(necessary(X),X)) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f7,axiom,(
% 9.94/1.64    (![X]: (( ~ is_a_theorem(X)| is_a_theorem(necessary(X)) ) ))),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f8,negated_conjecture,(
% 9.94/1.64    ~ is_a_theorem(implies(necessary(a),not(necessary(not(a))))) ),
% 9.94/1.64    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 9.94/1.64  fof(f9,plain,(
% 9.94/1.64    ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 9.94/1.64    inference(miniscoping,[status(esa)],[f1])).
% 9.94/1.64  fof(f10,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f9])).
% 9.94/1.64  fof(f11,plain,(
% 9.94/1.64    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0))))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f2])).
% 9.94/1.64  fof(f12,plain,(
% 9.94/1.64    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f3])).
% 9.94/1.64  fof(f13,plain,(
% 9.94/1.64    ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f4])).
% 9.94/1.64  fof(f14,plain,(
% 9.94/1.64    ![X0,X1]: (is_a_theorem(implies(necessary(implies(X0,X1)),implies(necessary(X0),necessary(X1)))))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f5])).
% 9.94/1.64  fof(f15,plain,(
% 9.94/1.64    ![X0]: (is_a_theorem(implies(necessary(X0),X0)))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f6])).
% 9.94/1.64  fof(f16,plain,(
% 9.94/1.64    ![X0]: (~is_a_theorem(X0)|is_a_theorem(necessary(X0)))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f7])).
% 9.94/1.64  fof(f17,plain,(
% 9.94/1.64    ~is_a_theorem(implies(necessary(a),not(necessary(not(a)))))),
% 9.94/1.64    inference(cnf_transformation,[status(esa)],[f8])).
% 9.94/1.64  fof(f19,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,X0)))),
% 9.94/1.64    inference(resolution,[status(thm)],[f10,f11])).
% 9.94/1.64  fof(f20,plain,(
% 9.94/1.64    ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|is_a_theorem(implies(implies(X0,X1),implies(X0,X2))))),
% 9.94/1.64    inference(resolution,[status(thm)],[f12,f10])).
% 9.94/1.64  fof(f30,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(implies(not(X0),not(X1)))|is_a_theorem(implies(X1,X0)))),
% 9.94/1.64    inference(resolution,[status(thm)],[f13,f10])).
% 9.94/1.64  fof(f42,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(necessary(implies(X0,X1)))|is_a_theorem(implies(necessary(X0),necessary(X1))))),
% 9.94/1.64    inference(resolution,[status(thm)],[f14,f10])).
% 9.94/1.64  fof(f43,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(necessary(implies(X0,X1)))|~is_a_theorem(necessary(X0))|is_a_theorem(necessary(X1)))),
% 9.94/1.64    inference(resolution,[status(thm)],[f42,f10])).
% 9.94/1.64  fof(f44,plain,(
% 9.94/1.64    ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(X0,X2)))),
% 9.94/1.64    inference(resolution,[status(thm)],[f20,f10])).
% 9.94/1.64  fof(f45,plain,(
% 9.94/1.64    ![X0,X1]: (~is_a_theorem(necessary(X0))|is_a_theorem(necessary(X1))|~is_a_theorem(implies(X0,X1)))),
% 9.94/1.64    inference(resolution,[status(thm)],[f43,f16])).
% 9.94/1.64  fof(f61,plain,(
% 9.94/1.64    spl0_6 <=> ~is_a_theorem(necessary(X0))),
% 9.94/1.64    introduced(split_symbol_definition)).
% 9.94/1.64  fof(f62,plain,(
% 9.94/1.64    ![X0]: (~is_a_theorem(necessary(X0))|~spl0_6)),
% 9.94/1.64    inference(component_clause,[status(thm)],[f61])).
% 9.94/1.64  fof(f64,plain,(
% 9.94/1.64    spl0_7 <=> is_a_theorem(necessary(X1))|~is_a_theorem(X1)),
% 9.94/1.65    introduced(split_symbol_definition)).
% 9.94/1.65  fof(f65,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(necessary(X0))|~is_a_theorem(X0)|~spl0_7)),
% 9.94/1.65    inference(component_clause,[status(thm)],[f64])).
% 9.94/1.65  fof(f67,plain,(
% 9.94/1.65    ![X0,X1]: (~is_a_theorem(necessary(X0))|is_a_theorem(necessary(X1))|~is_a_theorem(X1))),
% 9.94/1.65    inference(resolution,[status(thm)],[f45,f19])).
% 9.94/1.65  fof(f68,plain,(
% 9.94/1.65    spl0_6|spl0_7),
% 9.94/1.65    inference(split_clause,[status(thm)],[f67,f61,f64])).
% 9.94/1.65  fof(f117,plain,(
% 9.94/1.65    ![X0,X1]: (~is_a_theorem(implies(implies(not(X0),not(X1)),X1))|is_a_theorem(implies(implies(not(X0),not(X1)),X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f44,f13])).
% 9.94/1.65  fof(f125,plain,(
% 9.94/1.65    ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(X0,X2))|~is_a_theorem(implies(X1,X2)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f44,f19])).
% 9.94/1.65  fof(f126,plain,(
% 9.94/1.65    ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(implies(not(X0),X1))),X0))|~is_a_theorem(implies(not(X0),implies(not(implies(not(X0),X1)),X1))))),
% 9.94/1.65    inference(resolution,[status(thm)],[f117,f20])).
% 9.94/1.65  fof(f160,plain,(
% 9.94/1.65    ![X0]: (~is_a_theorem(X0)|~spl0_6)),
% 9.94/1.65    inference(forward_subsumption_resolution,[status(thm)],[f16,f62])).
% 9.94/1.65  fof(f161,plain,(
% 9.94/1.65    $false|~spl0_6),
% 9.94/1.65    inference(backward_subsumption_resolution,[status(thm)],[f15,f160])).
% 9.94/1.65  fof(f162,plain,(
% 9.94/1.65    ~spl0_6),
% 9.94/1.65    inference(contradiction_clause,[status(thm)],[f161])).
% 9.94/1.65  fof(f220,plain,(
% 9.94/1.65    ![X0,X1,X2]: (~is_a_theorem(implies(not(X0),X1))|~is_a_theorem(implies(X1,not(X2)))|is_a_theorem(implies(X2,X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f125,f30])).
% 9.94/1.65  fof(f225,plain,(
% 9.94/1.65    ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(not(X1),not(X2))))|is_a_theorem(implies(X0,implies(X2,X1))))),
% 9.94/1.65    inference(resolution,[status(thm)],[f125,f13])).
% 9.94/1.65  fof(f228,plain,(
% 9.94/1.65    ![X0,X1]: (~is_a_theorem(implies(X0,necessary(X1)))|is_a_theorem(implies(X0,X1)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f125,f15])).
% 9.94/1.65  fof(f252,plain,(
% 9.94/1.65    ![X0,X1]: (~is_a_theorem(necessary(implies(X0,X1)))|is_a_theorem(implies(necessary(X0),X1)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f42,f228])).
% 9.94/1.65  fof(f390,plain,(
% 9.94/1.65    ![X0,X1]: (is_a_theorem(implies(necessary(X0),X1))|~is_a_theorem(implies(X0,X1))|~spl0_7)),
% 9.94/1.65    inference(resolution,[status(thm)],[f252,f65])).
% 9.94/1.65  fof(f883,plain,(
% 9.94/1.65    ~is_a_theorem(implies(a,not(necessary(not(a)))))|~spl0_7),
% 9.94/1.65    inference(resolution,[status(thm)],[f17,f390])).
% 9.94/1.65  fof(f4170,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(implies(implies(not(X0),not(implies(not(X0),not(X0)))),X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f126,f11])).
% 9.94/1.65  fof(f8239,plain,(
% 9.94/1.65    ![X0,X1]: (is_a_theorem(implies(not(X0),implies(X0,X1))))),
% 9.94/1.65    inference(resolution,[status(thm)],[f225,f11])).
% 9.94/1.65  fof(f8889,plain,(
% 9.94/1.65    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),not(X2)))|is_a_theorem(implies(X2,X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f8239,f220])).
% 9.94/1.65  fof(f9366,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(implies(X0,not(not(X0)))))),
% 9.94/1.65    inference(resolution,[status(thm)],[f8889,f4170])).
% 9.94/1.65  fof(f9385,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(implies(not(not(X0)),X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f9366,f30])).
% 9.94/1.65  fof(f9448,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(implies(not(not(necessary(X0))),X0)))),
% 9.94/1.65    inference(resolution,[status(thm)],[f9385,f228])).
% 9.94/1.65  fof(f9718,plain,(
% 9.94/1.65    ![X0]: (is_a_theorem(implies(X0,not(necessary(not(X0))))))),
% 9.94/1.65    inference(resolution,[status(thm)],[f9448,f30])).
% 9.94/1.65  fof(f9833,plain,(
% 9.94/1.65    $false|~spl0_7),
% 9.94/1.65    inference(backward_subsumption_resolution,[status(thm)],[f883,f9718])).
% 9.94/1.65  fof(f9834,plain,(
% 9.94/1.65    ~spl0_7),
% 9.94/1.65    inference(contradiction_clause,[status(thm)],[f9833])).
% 9.94/1.65  fof(f9835,plain,(
% 9.94/1.65    $false),
% 9.94/1.65    inference(sat_refutation,[status(thm)],[f68,f162,f9834])).
% 9.94/1.65  % SZS output end CNFRefutation for theBenchmark.p
% 10.34/1.70  % Elapsed time: 1.334929 seconds
% 10.34/1.70  % CPU time: 10.401271 seconds
% 10.34/1.70  % Total memory used: 282.172 MB
% 10.34/1.70  % Net memory used: 257.889 MB
%------------------------------------------------------------------------------