↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

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

% Computer : n008.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 02:12:47 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET874+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 05:43:25 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.40  fof(f4,axiom,(
% 0.09/0.40    (! [A,B,C] :( C = unordered_pair(A,B)<=> (! [D] :( in(D,C)<=> ( D = A| D = B ) ) )) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f8,axiom,(
% 0.09/0.40    (! [A,B] :( in(A,B)=> set_union2(singleton(A),B) = B ) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f11,conjecture,(
% 0.09/0.40    (! [A,B] : set_union2(singleton(A),unordered_pair(A,B)) = unordered_pair(A,B) )),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f12,negated_conjecture,(
% 0.09/0.40    ~((! [A,B] : set_union2(singleton(A),unordered_pair(A,B)) = unordered_pair(A,B) ))),
% 0.09/0.40    inference(negated_conjecture,[status(cth)],[f11])).
% 0.09/0.40  fof(f17,plain,(
% 0.09/0.40    ![A,B,C]: ((~C=unordered_pair(A,B)|(![D]: ((~in(D,C)|(D=A|D=B))&(in(D,C)|(~D=A&~D=B)))))&(C=unordered_pair(A,B)|(?[D]: ((~in(D,C)|(~D=A&~D=B))&(in(D,C)|(D=A|D=B))))))),
% 0.09/0.40    inference(NNF_transformation,[status(thm)],[f4])).
% 0.09/0.40  fof(f18,plain,(
% 0.09/0.40    (![A,B,C]: (~C=unordered_pair(A,B)|((![D]: (~in(D,C)|(D=A|D=B)))&(![D]: (in(D,C)|(~D=A&~D=B))))))&(![A,B,C]: (C=unordered_pair(A,B)|(?[D]: ((~in(D,C)|(~D=A&~D=B))&(in(D,C)|(D=A|D=B))))))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f17])).
% 0.09/0.40  fof(f19,plain,(
% 0.09/0.40    (![A,B,C]: (~C=unordered_pair(A,B)|((![D]: (~in(D,C)|(D=A|D=B)))&(![D]: (in(D,C)|(~D=A&~D=B))))))&(![A,B,C]: (C=unordered_pair(A,B)|((~in(sK0_skl(C,B,A),C)|(~sK0_skl(C,B,A)=A&~sK0_skl(C,B,A)=B))&(in(sK0_skl(C,B,A),C)|(sK0_skl(C,B,A)=A|sK0_skl(C,B,A)=B)))))),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B,A))],[f18])).
% 0.09/0.40  fof(f21,plain,(
% 0.09/0.40    ![X0,X1,X2,X3]: (~X0=unordered_pair(X1,X2)|in(X3,X0)|~X3=X1)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f19])).
% 0.09/0.40  fof(f34,plain,(
% 0.09/0.40    ![A,B]: (~in(A,B)|set_union2(singleton(A),B)=B)),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f8])).
% 0.09/0.40  fof(f35,plain,(
% 0.09/0.40    ![X0,X1]: (~in(X0,X1)|set_union2(singleton(X0),X1)=X1)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f34])).
% 0.09/0.40  fof(f40,plain,(
% 0.09/0.40    (?[A,B]: ~set_union2(singleton(A),unordered_pair(A,B))=unordered_pair(A,B))),
% 0.09/0.40    inference(pre_NNF_transformation,[status(thm)],[f12])).
% 0.09/0.40  fof(f41,plain,(
% 0.09/0.40    ~set_union2(singleton(sK3_skl),unordered_pair(sK3_skl,sK4_skl))=unordered_pair(sK3_skl,sK4_skl)),
% 0.09/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl]),skolemize(A,sK3_skl),skolemize(B,sK4_skl)],[f40])).
% 0.09/0.40  fof(f42,plain,(
% 0.09/0.40    ~set_union2(singleton(sK3_skl),unordered_pair(sK3_skl,sK4_skl))=unordered_pair(sK3_skl,sK4_skl)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f41])).
% 0.09/0.40  fof(f44,plain,(
% 0.09/0.40    ![X0,X1]: (in(X0,unordered_pair(X0,X1)))),
% 0.09/0.40    inference(destructive_equality_resolution,[status(thm)],[f21])).
% 0.09/0.40  fof(f57,plain,(
% 0.09/0.40    ![X0,X1]: (set_union2(singleton(X0),unordered_pair(X0,X1))=unordered_pair(X0,X1))),
% 0.09/0.40    inference(resolution,[status(thm)],[f44,f35])).
% 0.09/0.40  fof(f60,plain,(
% 0.09/0.40    ~unordered_pair(sK3_skl,sK4_skl)=unordered_pair(sK3_skl,sK4_skl)),
% 0.09/0.40    inference(backward_demodulation,[status(thm)],[f57,f42])).
% 0.09/0.40  fof(f63,plain,(
% 0.09/0.40    $false),
% 0.09/0.40    inference(trivial_equality_resolution,[status(thm)],[f60])).
% 0.09/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.42  % Elapsed time: 0.060410 seconds
% 0.09/0.42  % CPU time: 0.149961 seconds
% 0.09/0.42  % Total memory used: 101.439 MB
% 0.09/0.42  % Net memory used: 101.027 MB
%------------------------------------------------------------------------------