↑ 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  : SWC131-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n011.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:41:40 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC131-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n011.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 07:58:11 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.40  fof(f7,axiom,(
% 0.09/0.40    cyclefreeP(nil) ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f8,axiom,(
% 0.09/0.40    ssList(nil) ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f100,axiom,(
% 0.09/0.40    (![U,V]: (( ~ ssList(U)| ~ ssList(V)| neq(V,U)| V = U ) ))),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f189,negated_conjecture,(
% 0.09/0.40    ssList(sk4) ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f190,negated_conjecture,(
% 0.09/0.40    sk2 = sk4 ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f192,negated_conjecture,(
% 0.09/0.40    ~ neq(sk4,nil) ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f193,negated_conjecture,(
% 0.09/0.40    ~ cyclefreeP(sk2) ),
% 0.09/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f200,plain,(
% 0.09/0.40    cyclefreeP(nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f7])).
% 0.09/0.40  fof(f201,plain,(
% 0.09/0.40    ssList(nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f8])).
% 0.09/0.40  fof(f296,plain,(
% 0.09/0.40    ![X0,X1]: (~ssList(X0)|~ssList(X1)|neq(X1,X0)|X1=X0)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f100])).
% 0.09/0.40  fof(f427,plain,(
% 0.09/0.40    ssList(sk4)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f189])).
% 0.09/0.40  fof(f428,plain,(
% 0.09/0.40    sk2=sk4),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f190])).
% 0.09/0.40  fof(f430,plain,(
% 0.09/0.40    ~neq(sk4,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f192])).
% 0.09/0.40  fof(f431,plain,(
% 0.09/0.40    ~cyclefreeP(sk2)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f193])).
% 0.09/0.40  fof(f470,plain,(
% 0.09/0.40    ~cyclefreeP(sk4)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f428,f431])).
% 0.09/0.40  fof(f471,plain,(
% 0.09/0.40    ![X0]: (~ssList(X0)|neq(X0,nil)|X0=nil)),
% 0.09/0.40    inference(resolution,[status(thm)],[f296,f201])).
% 0.09/0.40  fof(f475,plain,(
% 0.09/0.40    neq(sk4,nil)|sk4=nil),
% 0.09/0.40    inference(resolution,[status(thm)],[f471,f427])).
% 0.09/0.40  fof(f484,definition,(
% 0.09/0.40    sQ4_spl <=> (neq(sk4,nil))),
% 0.09/0.40    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.09/0.40  fof(f485,plain,(
% 0.09/0.40    neq(sk4,nil)|~sQ4_spl),
% 0.09/0.40    inference(component_clause,[status(thm)],[f484])).
% 0.09/0.40  fof(f487,definition,(
% 0.09/0.40    sQ5_spl <=> (sk4=nil)),
% 0.09/0.40    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.09/0.40  fof(f488,plain,(
% 0.09/0.40    sk4=nil|~sQ5_spl),
% 0.09/0.40    inference(component_clause,[status(thm)],[f487])).
% 0.09/0.40  fof(f490,plain,(
% 0.09/0.40    sQ4_spl|sQ5_spl),
% 0.09/0.40    inference(split_clause,[status(thm)],[f475,f484,f487])).
% 0.09/0.40  fof(f498,plain,(
% 0.09/0.40    $false|~sQ4_spl),
% 0.09/0.40    inference(forward_subsumption_resolution,[status(thm)],[f485,f430])).
% 0.09/0.40  fof(f499,plain,(
% 0.09/0.40    ~sQ4_spl),
% 0.09/0.40    inference(contradiction_clause,[status(thm)],[f498])).
% 0.09/0.40  fof(f516,plain,(
% 0.09/0.40    cyclefreeP(sk4)|~sQ5_spl),
% 0.09/0.40    inference(backward_demodulation,[status(thm)],[f488,f200])).
% 0.09/0.40  fof(f518,plain,(
% 0.09/0.40    $false|~sQ5_spl),
% 0.09/0.40    inference(forward_subsumption_resolution,[status(thm)],[f516,f470])).
% 0.09/0.40  fof(f519,plain,(
% 0.09/0.40    ~sQ5_spl),
% 0.09/0.40    inference(contradiction_clause,[status(thm)],[f518])).
% 0.09/0.40  fof(f520,plain,(
% 0.09/0.40    $false),
% 0.09/0.40    inference(sat_refutation,[status(thm)],[f490,f499,f519])).
% 0.09/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.44  % Elapsed time: 0.064774 seconds
% 0.09/0.44  % CPU time: 0.166723 seconds
% 0.09/0.44  % Total memory used: 108.354 MB
% 0.09/0.44  % Net memory used: 108.187 MB
%------------------------------------------------------------------------------