↑ 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  : SYN960+1 : TPTP v9.3.1. Released v3.1.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 03:21:37 PM UTC 2026

% Result   : Theorem 0.11s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN960+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n009.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 11:31:12 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  % Drodi V4.1.1
% 0.11/0.38  % Refutation found
% 0.11/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.38  % SZS output start CNFRefutation for theBenchmark
% 0.11/0.38  fof(f1,conjecture,(
% 0.11/0.38    ( (? [X,Y] : a(X,Y))<=> (? [Y,X] : a(X,Y) )) ),
% 0.11/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.38  fof(f2,negated_conjecture,(
% 0.11/0.38    ~(( (? [X,Y] : a(X,Y))<=> (? [Y,X] : a(X,Y) )) )),
% 0.11/0.38    inference(negated_conjecture,[status(cth)],[f1])).
% 0.11/0.38  fof(f3,plain,(
% 0.11/0.38    ((?[X,Y]: a(X,Y))<~>(?[Y,X]: a(X,Y)))),
% 0.11/0.38    inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.11/0.38  fof(f4,plain,(
% 0.11/0.38    ((?[X,Y]: a(X,Y))|(?[Y,X]: a(X,Y)))&((![X,Y]: ~a(X,Y))|(![Y,X]: ~a(X,Y)))),
% 0.11/0.38    inference(NNF_transformation,[status(thm)],[f3])).
% 0.11/0.38  fof(f5,plain,(
% 0.11/0.38    (a(sK0_skl,sK1_skl)|a(sK3_skl,sK2_skl))&((![X,Y]: ~a(X,Y))|(![Y,X]: ~a(X,Y)))),
% 0.11/0.38    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(X,sK0_skl),skolemize(Y,sK1_skl),skolemize(Y,sK2_skl),skolemize(X,sK3_skl)],[f4])).
% 0.11/0.38  fof(f6,plain,(
% 0.11/0.38    a(sK0_skl,sK1_skl)|a(sK3_skl,sK2_skl)),
% 0.11/0.38    inference(cnf_transformation,[status(thm)],[f5])).
% 0.11/0.38  fof(f7,plain,(
% 0.11/0.38    ![X0,X1,X2,X3]: (~a(X0,X1)|~a(X2,X3))),
% 0.11/0.38    inference(cnf_transformation,[status(thm)],[f5])).
% 0.11/0.38  fof(f8,definition,(
% 0.11/0.38    sQ0_spl <=> (a(sK0_skl,sK1_skl))),
% 0.11/0.38    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.11/0.38  fof(f9,plain,(
% 0.11/0.38    a(sK0_skl,sK1_skl)|~sQ0_spl),
% 0.11/0.38    inference(component_clause,[status(thm)],[f8])).
% 0.11/0.38  fof(f11,definition,(
% 0.11/0.38    sQ1_spl <=> (a(sK3_skl,sK2_skl))),
% 0.11/0.38    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.11/0.38  fof(f12,plain,(
% 0.11/0.38    a(sK3_skl,sK2_skl)|~sQ1_spl),
% 0.11/0.38    inference(component_clause,[status(thm)],[f11])).
% 0.11/0.38  fof(f14,plain,(
% 0.11/0.38    sQ0_spl|sQ1_spl),
% 0.11/0.38    inference(split_clause,[status(thm)],[f6,f8,f11])).
% 0.11/0.38  fof(f15,definition,(
% 0.11/0.38    ![X0,X1]: (sQ2_spl <=> (~a(X0,X1)))),
% 0.11/0.38    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.11/0.38  fof(f16,plain,(
% 0.11/0.38    ![X0,X1]: (~a(X0,X1)|~sQ2_spl)),
% 0.11/0.38    inference(component_clause,[status(thm)],[f15])).
% 0.11/0.38  fof(f18,plain,(
% 0.11/0.38    sQ2_spl),
% 0.11/0.38    inference(split_clause,[status(thm)],[f7,f15])).
% 0.11/0.38  fof(f19,plain,(
% 0.11/0.38    $false|~sQ2_spl|~sQ0_spl),
% 0.11/0.38    inference(forward_subsumption_resolution,[status(thm)],[f9,f16])).
% 0.11/0.38  fof(f20,plain,(
% 0.11/0.38    ~sQ2_spl|~sQ0_spl),
% 0.11/0.38    inference(contradiction_clause,[status(thm)],[f19])).
% 0.11/0.38  fof(f21,plain,(
% 0.11/0.38    $false|~sQ2_spl|~sQ1_spl),
% 0.11/0.38    inference(forward_subsumption_resolution,[status(thm)],[f12,f16])).
% 0.11/0.38  fof(f22,plain,(
% 0.11/0.38    ~sQ2_spl|~sQ1_spl),
% 0.11/0.38    inference(contradiction_clause,[status(thm)],[f21])).
% 0.11/0.38  fof(f23,plain,(
% 0.11/0.38    $false),
% 0.11/0.38    inference(sat_refutation,[status(thm)],[f14,f18,f20,f22])).
% 0.11/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.11/0.40  % Elapsed time: 0.034507 seconds
% 0.11/0.40  % CPU time: 0.083579 seconds
% 0.11/0.40  % Total memory used: 12.348 MB
% 0.11/0.40  % Net memory used: 11.872 MB
%------------------------------------------------------------------------------