↑ 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  : SEU150+2 : TPTP v9.3.1. Released v3.3.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 02:21:48 PM UTC 2026

% Result   : Theorem 0.10s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:53:12 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.39  fof(f7,axiom,(
% 0.10/0.39    (! [A,B] :( B = singleton(A)<=> (! [C] :( in(C,B)<=> C = A ) )) )),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f10,axiom,(
% 0.10/0.39    (! [A,B,C] :( C = unordered_pair(A,B)<=> (! [D] :( in(D,C)<=> ( D = A| D = B ) ) )) )),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f73,conjecture,(
% 0.10/0.39    (! [A,B,C] :( singleton(A) = unordered_pair(B,C)=> B = C ) )),
% 0.10/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39  fof(f74,negated_conjecture,(
% 0.10/0.39    ~((! [A,B,C] :( singleton(A) = unordered_pair(B,C)=> B = C ) ))),
% 0.10/0.39    inference(negated_conjecture,[status(cth)],[f73])).
% 0.10/0.39  fof(f87,plain,(
% 0.10/0.39    ![A,B]: ((~B=singleton(A)|(![C]: ((~in(C,B)|C=A)&(in(C,B)|~C=A))))&(B=singleton(A)|(?[C]: ((~in(C,B)|~C=A)&(in(C,B)|C=A)))))),
% 0.10/0.39    inference(NNF_transformation,[status(thm)],[f7])).
% 0.10/0.39  fof(f88,plain,(
% 0.10/0.39    (![A,B]: (~B=singleton(A)|((![C]: (~in(C,B)|C=A))&(![C]: (in(C,B)|~C=A)))))&(![A,B]: (B=singleton(A)|(?[C]: ((~in(C,B)|~C=A)&(in(C,B)|C=A)))))),
% 0.10/0.39    inference(miniscoping,[status(thm)],[f87])).
% 0.10/0.39  fof(f89,plain,(
% 0.10/0.39    (![A,B]: (~B=singleton(A)|((![C]: (~in(C,B)|C=A))&(![C]: (in(C,B)|~C=A)))))&(![A,B]: (B=singleton(A)|((~in(sK0_skl(B,A),B)|~sK0_skl(B,A)=A)&(in(sK0_skl(B,A),B)|sK0_skl(B,A)=A))))),
% 0.10/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f88])).
% 0.10/0.39  fof(f90,plain,(
% 0.10/0.39    ![X0,X1,X2]: (~X0=singleton(X1)|~in(X2,X0)|X2=X1)),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f89])).
% 0.10/0.39  fof(f106,plain,(
% 0.10/0.39    ![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.10/0.39    inference(NNF_transformation,[status(thm)],[f10])).
% 0.10/0.39  fof(f107,plain,(
% 0.10/0.39    (![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.10/0.39    inference(miniscoping,[status(thm)],[f106])).
% 0.10/0.39  fof(f108,plain,(
% 0.10/0.39    (![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(sK3_skl(C,B,A),C)|(~sK3_skl(C,B,A)=A&~sK3_skl(C,B,A)=B))&(in(sK3_skl(C,B,A),C)|(sK3_skl(C,B,A)=A|sK3_skl(C,B,A)=B)))))),
% 0.10/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(D,sK3_skl(C,B,A))],[f107])).
% 0.10/0.39  fof(f110,plain,(
% 0.10/0.39    ![X0,X1,X2,X3]: (~X0=unordered_pair(X1,X2)|in(X3,X0)|~X3=X1)),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f108])).
% 0.10/0.39  fof(f111,plain,(
% 0.10/0.39    ![X0,X1,X2,X3]: (~X0=unordered_pair(X1,X2)|in(X3,X0)|~X3=X2)),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f108])).
% 0.10/0.39  fof(f272,plain,(
% 0.10/0.39    (?[A,B,C]: (singleton(A)=unordered_pair(B,C)&~B=C))),
% 0.10/0.39    inference(pre_NNF_transformation,[status(thm)],[f74])).
% 0.10/0.39  fof(f273,plain,(
% 0.10/0.39    ?[B,C]: ((?[A]: singleton(A)=unordered_pair(B,C))&~B=C)),
% 0.10/0.39    inference(miniscoping,[status(thm)],[f272])).
% 0.10/0.39  fof(f274,plain,(
% 0.10/0.39    (singleton(sK15_skl)=unordered_pair(sK13_skl,sK14_skl)&~sK13_skl=sK14_skl)),
% 0.10/0.39    inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl,sK15_skl]),skolemize(B,sK13_skl),skolemize(C,sK14_skl),skolemize(A,sK15_skl)],[f273])).
% 0.10/0.39  fof(f275,plain,(
% 0.10/0.39    singleton(sK15_skl)=unordered_pair(sK13_skl,sK14_skl)),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f274])).
% 0.10/0.39  fof(f276,plain,(
% 0.10/0.39    ~sK13_skl=sK14_skl),
% 0.10/0.39    inference(cnf_transformation,[status(thm)],[f274])).
% 0.10/0.39  fof(f279,plain,(
% 0.10/0.39    ![X0,X1]: (~in(X0,singleton(X1))|X0=X1)),
% 0.10/0.39    inference(destructive_equality_resolution,[status(thm)],[f90])).
% 0.10/0.39  fof(f285,plain,(
% 0.10/0.39    ![X0,X1]: (in(X0,unordered_pair(X0,X1)))),
% 0.10/0.39    inference(destructive_equality_resolution,[status(thm)],[f110])).
% 0.10/0.39  fof(f286,plain,(
% 0.10/0.39    ![X0,X1]: (in(X0,unordered_pair(X1,X0)))),
% 0.10/0.39    inference(destructive_equality_resolution,[status(thm)],[f111])).
% 0.10/0.39  fof(f299,plain,(
% 0.10/0.39    in(sK13_skl,singleton(sK15_skl))),
% 0.10/0.39    inference(paramodulation,[status(thm)],[f275,f285])).
% 0.10/0.39  fof(f300,plain,(
% 0.10/0.39    in(sK14_skl,singleton(sK15_skl))),
% 0.10/0.39    inference(paramodulation,[status(thm)],[f275,f286])).
% 0.10/0.39  fof(f315,plain,(
% 0.10/0.39    sK13_skl=sK15_skl),
% 0.10/0.39    inference(resolution,[status(thm)],[f279,f299])).
% 0.10/0.39  fof(f319,plain,(
% 0.10/0.39    ~sK15_skl=sK14_skl),
% 0.10/0.39    inference(backward_demodulation,[status(thm)],[f315,f276])).
% 0.10/0.39  fof(f320,plain,(
% 0.10/0.39    sK14_skl=sK15_skl),
% 0.10/0.39    inference(resolution,[status(thm)],[f300,f279])).
% 0.10/0.39  fof(f321,plain,(
% 0.10/0.39    $false),
% 0.10/0.39    inference(forward_subsumption_resolution,[status(thm)],[f320,f319])).
% 0.10/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.42  % Elapsed time: 0.046486 seconds
% 0.14/0.42  % CPU time: 0.084504 seconds
% 0.14/0.42  % Total memory used: 9.910 MB
% 0.14/0.42  % Net memory used: 9.904 MB
%------------------------------------------------------------------------------