↑ 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  : LCL118-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 : n026.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:24 PM UTC 2026

% Result   : Unsatisfiable 0.95s 0.58s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL118-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.09/0.35  % Computer : n026.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 00:08:51 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.95/0.58  % Refutation found
% 0.95/0.58  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.95/0.58  % SZS output start CNFRefutation for theBenchmark
% 0.95/0.58  fof(f1,axiom,(
% 0.95/0.58    (![X,Y]: (( ~ is_a_theorem(equivalent(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.95/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.95/0.58  fof(f2,axiom,(
% 0.95/0.58    (![X,Y,Z]: (is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(Y,X)))) ))),
% 0.95/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.95/0.58  fof(f3,negated_conjecture,(
% 0.95/0.58    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))) ),
% 0.95/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.95/0.58  fof(f4,plain,(
% 0.95/0.58    ![Y]: ((![X]: (~is_a_theorem(equivalent(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.95/0.58    inference(miniscoping,[status(thm)],[f1])).
% 0.95/0.58  fof(f5,plain,(
% 0.95/0.58    ![X0,X1]: (~is_a_theorem(equivalent(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.95/0.58    inference(cnf_transformation,[status(thm)],[f4])).
% 0.95/0.58  fof(f6,plain,(
% 0.95/0.58    ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))))),
% 0.95/0.58    inference(cnf_transformation,[status(thm)],[f2])).
% 0.95/0.58  fof(f7,plain,(
% 0.95/0.58    ~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a))))),
% 0.95/0.58    inference(cnf_transformation,[status(thm)],[f3])).
% 0.95/0.58  fof(f8,plain,(
% 0.95/0.58    ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,equivalent(X1,X2)))|is_a_theorem(equivalent(X2,equivalent(X1,X0))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f6,f5])).
% 0.95/0.58  fof(f9,plain,(
% 0.95/0.58    ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X1,equivalent(X0,X2))))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f8,f6])).
% 0.95/0.58  fof(f11,plain,(
% 0.95/0.58    ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,X1))|is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,X2)))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f9,f5])).
% 0.95/0.58  fof(f12,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0)))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f11,f6])).
% 0.95/0.58  fof(f13,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f11,f9])).
% 0.95/0.58  fof(f14,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X3),equivalent(equivalent(X2,equivalent(X1,X0)),X3))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f12,f8])).
% 0.95/0.58  fof(f17,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f13,f8])).
% 0.95/0.58  fof(f22,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (~is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X3))|is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X0)),X3)))),
% 0.95/0.58    inference(resolution,[status(thm)],[f14,f5])).
% 0.95/0.58  fof(f28,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (~is_a_theorem(equivalent(equivalent(X0,X1),X2))|is_a_theorem(equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2)))),
% 0.95/0.58    inference(resolution,[status(thm)],[f17,f5])).
% 0.95/0.58  fof(f32,plain,(
% 0.95/0.58    ![X0,X1,X2,X3,X4]: (~is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,X4)))|is_a_theorem(equivalent(X4,equivalent(X3,equivalent(X2,equivalent(X1,X0))))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f22,f8])).
% 0.95/0.58  fof(f44,plain,(
% 0.95/0.58    ![X0,X1,X2,X3]: (~is_a_theorem(equivalent(equivalent(X0,X1),X2))|~is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X0,X3))))|is_a_theorem(X2))),
% 0.95/0.58    inference(resolution,[status(thm)],[f28,f5])).
% 0.95/0.58  fof(f80,plain,(
% 0.95/0.58    ![X0,X1]: (~is_a_theorem(equivalent(equivalent(X0,X0),X1))|is_a_theorem(X1))),
% 0.95/0.58    inference(resolution,[status(thm)],[f44,f9])).
% 0.95/0.58  fof(f89,plain,(
% 0.95/0.58    ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(X2,X0))),equivalent(X2,X1))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f80,f17])).
% 0.95/0.58  fof(f91,plain,(
% 0.95/0.58    ![X0,X1]: (is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))))),
% 0.95/0.58    inference(resolution,[status(thm)],[f80,f6])).
% 0.95/0.58  fof(f106,plain,(
% 0.95/0.58    ![X0,X1,X2]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,X0)))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f91,f11])).
% 0.95/0.59  fof(f107,plain,(
% 0.95/0.59    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(equivalent(X1,equivalent(X1,X0))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f91,f5])).
% 0.95/0.59  fof(f124,plain,(
% 0.95/0.59    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(equivalent(equivalent(X1,X1),X0)))),
% 0.95/0.59    inference(resolution,[status(thm)],[f107,f80])).
% 0.95/0.59  fof(f146,plain,(
% 0.95/0.59    ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,X1))|is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X2,X2)))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f124,f8])).
% 0.95/0.59  fof(f159,plain,(
% 0.95/0.59    ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X0))))|is_a_theorem(equivalent(X2,X1)))),
% 0.95/0.59    inference(resolution,[status(thm)],[f89,f5])).
% 0.95/0.59  fof(f190,plain,(
% 0.95/0.59    ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),equivalent(X1,equivalent(X2,X2)))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f106,f80])).
% 0.95/0.59  fof(f484,plain,(
% 0.95/0.59    ![X0,X1]: (is_a_theorem(equivalent(X0,X1))|~is_a_theorem(equivalent(X1,X0)))),
% 0.95/0.59    inference(resolution,[status(thm)],[f159,f146])).
% 0.95/0.59  fof(f496,plain,(
% 0.95/0.59    ~is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(c,a)),equivalent(a,b)))),
% 0.95/0.59    inference(resolution,[status(thm)],[f484,f7])).
% 0.95/0.59  fof(f768,plain,(
% 0.95/0.59    ~is_a_theorem(equivalent(equivalent(a,equivalent(c,equivalent(c,b))),equivalent(a,b)))),
% 0.95/0.59    inference(resolution,[status(thm)],[f496,f22])).
% 0.95/0.59  fof(f1106,plain,(
% 0.95/0.59    ~is_a_theorem(equivalent(equivalent(a,b),equivalent(a,equivalent(c,equivalent(c,b)))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f768,f484])).
% 0.95/0.59  fof(f1112,plain,(
% 0.95/0.59    ~is_a_theorem(equivalent(equivalent(b,equivalent(c,c)),equivalent(a,equivalent(a,b))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f1106,f32])).
% 0.95/0.59  fof(f1121,plain,(
% 0.95/0.59    ~is_a_theorem(equivalent(equivalent(a,equivalent(a,b)),equivalent(b,equivalent(c,c))))),
% 0.95/0.59    inference(resolution,[status(thm)],[f1112,f484])).
% 0.95/0.59  fof(f1123,plain,(
% 0.95/0.59    $false),
% 0.95/0.59    inference(forward_subsumption_resolution,[status(thm)],[f1121,f190])).
% 0.95/0.59  % SZS output end CNFRefutation for theBenchmark.p
% 0.95/0.60  % Elapsed time: 0.241946 seconds
% 0.95/0.60  % CPU time: 1.678141 seconds
% 0.95/0.60  % Total memory used: 88.315 MB
% 0.95/0.60  % Net memory used: 83.047 MB
%------------------------------------------------------------------------------