↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n015.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 03:13:26 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.62s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   41 (  38 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   9   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   6 con; 0-2 aty)
%            Number of variables   :   53 (  53   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [Q] : impl(btrue,Q) = Q,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [Y] : append(nil,Y) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [Z,Xs,Y] : append(cons(Z,Xs),Y) = cons(Z,append(Xs,Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    linP(pB) = cons(b,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,axiom,
    linP(pE) = nil,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [P,Q] : linC(c2(P,Q)) = append(linP(P),linP(Q)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    ! [X,Y] : unambig(X,Y) = impl(eq(linC(X),linC(Y)),eq4(X,Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,axiom,
    eq3(pE,pB) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f38,axiom,
    ! [X,Z,Y,X2] :
      ( eq4(c2(X,Y),c2(Z,X2)) = bfalse
      | eq3(X,Z) != bfalse ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f40,axiom,
    ! [X] : eq(X,X) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f44,axiom,
    ! [X] : eq5(X,X) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f49,negated_conjecture,
    ! [X,Y] : eq5(unambig(X,Y),bfalse) != btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f50,plain,
    ! [X0] : impl(btrue,X0) = X0,
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f52,plain,
    ! [X0] : append(nil,X0) = X0,
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f53,plain,
    ! [X0,X1,X2] : append(cons(X0,X1),X2) = cons(X0,append(X1,X2)),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f57,plain,
    linP(pB) = cons(b,nil),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f58,plain,
    linP(pE) = nil,
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f59,plain,
    ! [X0,X1] : linC(c2(X0,X1)) = append(linP(X0),linP(X1)),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f60,plain,
    ! [X0,X1] : unambig(X0,X1) = impl(eq(linC(X0),linC(X1)),eq4(X0,X1)),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f68,plain,
    eq3(pE,pB) = bfalse,
    inference(cnf_transformation,[status(thm)],[f19]) ).

fof(f87,plain,
    ! [X,Z] :
      ( ! [Y,X2] : eq4(c2(X,Y),c2(Z,X2)) = bfalse
      | eq3(X,Z) != bfalse ),
    inference(miniscoping,[status(thm)],[f38]) ).

fof(f88,plain,
    ! [X0,X1,X2,X3] :
      ( eq4(c2(X0,X2),c2(X1,X3)) = bfalse
      | eq3(X0,X1) != bfalse ),
    inference(cnf_transformation,[status(thm)],[f87]) ).

fof(f91,plain,
    ! [X0] : eq(X0,X0) = btrue,
    inference(cnf_transformation,[status(thm)],[f40]) ).

fof(f95,plain,
    ! [X0] : eq5(X0,X0) = btrue,
    inference(cnf_transformation,[status(thm)],[f44]) ).

fof(f102,plain,
    ! [X0,X1] : eq5(unambig(X0,X1),bfalse) != btrue,
    inference(cnf_transformation,[status(thm)],[f49]) ).

fof(f113,plain,
    ! [X0,X1] : append(cons(X0,nil),X1) = cons(X0,X1),
    inference(paramodulation,[status(thm)],[f52,f53]) ).

fof(f130,plain,
    ! [X0] : linC(c2(pE,X0)) = append(nil,linP(X0)),
    inference(paramodulation,[status(thm)],[f58,f59]) ).

fof(f131,plain,
    ! [X0] : linC(c2(X0,pE)) = append(linP(X0),nil),
    inference(paramodulation,[status(thm)],[f58,f59]) ).

fof(f133,plain,
    ! [X0] : linC(c2(pE,X0)) = linP(X0),
    inference(forward_demodulation,[status(thm)],[f52,f130]) ).

fof(f200,plain,
    ! [X0] : append(linP(pB),X0) = cons(b,X0),
    inference(paramodulation,[status(thm)],[f57,f113]) ).

fof(f227,plain,
    ! [X0,X1] : unambig(X0,c2(X1,pE)) = impl(eq(linC(X0),append(linP(X1),nil)),eq4(X0,c2(X1,pE))),
    inference(paramodulation,[status(thm)],[f131,f60]) ).

fof(f291,plain,
    ! [X0,X1] : eq4(c2(pE,X0),c2(pB,X1)) = bfalse,
    inference(resolution,[status(thm)],[f88,f68]) ).

fof(f563,plain,
    ! [X0] : unambig(c2(pE,X0),c2(pB,pE)) = impl(eq(linC(c2(pE,X0)),append(linP(pB),nil)),bfalse),
    inference(paramodulation,[status(thm)],[f291,f227]) ).

fof(f574,plain,
    ! [X0] : unambig(c2(pE,X0),c2(pB,pE)) = impl(eq(linP(X0),append(linP(pB),nil)),bfalse),
    inference(forward_demodulation,[status(thm)],[f133,f563]) ).

fof(f575,plain,
    ! [X0] : unambig(c2(pE,X0),c2(pB,pE)) = impl(eq(linP(X0),cons(b,nil)),bfalse),
    inference(forward_demodulation,[status(thm)],[f200,f574]) ).

fof(f576,plain,
    ! [X0] : unambig(c2(pE,X0),c2(pB,pE)) = impl(eq(linP(X0),linP(pB)),bfalse),
    inference(forward_demodulation,[status(thm)],[f57,f575]) ).

fof(f699,plain,
    ! [X0] : eq5(impl(eq(linP(X0),linP(pB)),bfalse),bfalse) != btrue,
    inference(paramodulation,[status(thm)],[f576,f102]) ).

fof(f704,plain,
    eq5(impl(btrue,bfalse),bfalse) != btrue,
    inference(paramodulation,[status(thm)],[f91,f699]) ).

fof(f706,plain,
    eq5(bfalse,bfalse) != btrue,
    inference(forward_demodulation,[status(thm)],[f50,f704]) ).

fof(f707,plain,
    btrue != btrue,
    inference(forward_demodulation,[status(thm)],[f95,f706]) ).

fof(f708,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f707]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.57  % Computer : n015.cluster.edu
% 0.12/0.57  % Model    : x86_64 x86_64
% 0.12/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.57  % Memory   : 8046.5625MB
% 0.12/0.57  % OS       : Linux 6.8.0-71-generic
% 0.12/0.57  % CPULimit : 300
% 0.12/0.57  % WCLimit  : 300
% 0.12/0.57  % DateTime : Mon Sep 21 10:36:23 UTC 2026
% 0.12/0.57  % CPUTime  : 
% 0.14/0.58  % Drodi V4.1.1
% 0.14/0.62  % Refutation found
% 0.14/0.62  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.65  % Elapsed time: 0.063441 seconds
% 0.14/0.65  % CPU time: 0.291246 seconds
% 0.14/0.65  % Total memory used: 70.986 MB
% 0.14/0.65  % Net memory used: 70.923 MB
%------------------------------------------------------------------------------