↑ 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  : NUM022-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/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 01:42:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM022-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n009.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 01:59:28 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.37  % Refutation found
% 0.09/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.37  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.37  fof(f1,axiom,(
% 0.09/0.37    (![A,B,C]: (( ~ less(A,B)| ~ less(C,A)| less(C,B) ) ))),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f2,axiom,(
% 0.09/0.37    (![A,B,C]: (( ~ equalish(add(successor(A),B),C)| less(B,C) ) ))),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f3,axiom,(
% 0.09/0.37    (![A,B]: (( ~ less(A,B)| equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ) ))),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f4,axiom,(
% 0.09/0.37    (![A,B]: (( ~ divides(A,B)| less(A,B)| equalish(A,B) ) ))),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f7,axiom,(
% 0.09/0.37    (![A,B,C]: (( ~ equalish(A,B)| ~ equalish(C,A)| equalish(C,B) ) ))),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f8,hypothesis,(
% 0.09/0.37    less(a,b) ),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f9,hypothesis,(
% 0.09/0.37    divides(b,d) ),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f10,negated_conjecture,(
% 0.09/0.37    ~ less(a,d) ),
% 0.09/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/0.37  fof(f11,plain,(
% 0.09/0.37    ![B,C]: ((![A]: (~less(A,B)|~less(C,A)))|less(C,B))),
% 0.09/0.37    inference(miniscoping,[status(thm)],[f1])).
% 0.09/0.37  fof(f12,plain,(
% 0.09/0.37    ![X0,X1,X2]: (~less(X0,X1)|~less(X2,X0)|less(X2,X1))),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f11])).
% 0.09/0.37  fof(f13,plain,(
% 0.09/0.37    ![B,C]: ((![A]: ~equalish(add(successor(A),B),C))|less(B,C))),
% 0.09/0.37    inference(miniscoping,[status(thm)],[f2])).
% 0.09/0.37  fof(f14,plain,(
% 0.09/0.37    ![X0,X1,X2]: (~equalish(add(successor(X0),X1),X2)|less(X1,X2))),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f13])).
% 0.09/0.37  fof(f15,plain,(
% 0.09/0.37    ![X0,X1]: (~less(X0,X1)|equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1))),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f3])).
% 0.09/0.37  fof(f16,plain,(
% 0.09/0.37    ![X0,X1]: (~divides(X0,X1)|less(X0,X1)|equalish(X0,X1))),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f4])).
% 0.09/0.37  fof(f19,plain,(
% 0.09/0.37    ![B,C]: ((![A]: (~equalish(A,B)|~equalish(C,A)))|equalish(C,B))),
% 0.09/0.37    inference(miniscoping,[status(thm)],[f7])).
% 0.09/0.37  fof(f20,plain,(
% 0.09/0.37    ![X0,X1,X2]: (~equalish(X0,X1)|~equalish(X2,X0)|equalish(X2,X1))),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f19])).
% 0.09/0.37  fof(f21,plain,(
% 0.09/0.37    less(a,b)),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f8])).
% 0.09/0.37  fof(f22,plain,(
% 0.09/0.37    divides(b,d)),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f9])).
% 0.09/0.37  fof(f23,plain,(
% 0.09/0.37    ~less(a,d)),
% 0.09/0.37    inference(cnf_transformation,[status(thm)],[f10])).
% 0.09/0.37  fof(f24,plain,(
% 0.09/0.37    ![X0]: (~less(b,X0)|less(a,X0))),
% 0.09/0.37    inference(resolution,[status(thm)],[f12,f21])).
% 0.09/0.37  fof(f26,plain,(
% 0.09/0.37    equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),b)),
% 0.09/0.37    inference(resolution,[status(thm)],[f15,f21])).
% 0.09/0.37  fof(f28,plain,(
% 0.09/0.37    ![X0]: (~equalish(b,X0)|equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),X0))),
% 0.09/0.37    inference(resolution,[status(thm)],[f26,f20])).
% 0.09/0.37  fof(f32,plain,(
% 0.09/0.37    less(b,d)|equalish(b,d)),
% 0.09/0.37    inference(resolution,[status(thm)],[f16,f22])).
% 0.09/0.37  fof(f47,definition,(
% 0.09/0.37    sQ4_spl <=> (less(b,d))),
% 0.09/0.37    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.09/0.37  fof(f48,plain,(
% 0.09/0.37    less(b,d)|~sQ4_spl),
% 0.09/0.37    inference(component_clause,[status(thm)],[f47])).
% 0.09/0.37  fof(f50,definition,(
% 0.09/0.37    sQ5_spl <=> (equalish(b,d))),
% 0.09/0.37    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition])).
% 0.09/0.37  fof(f51,plain,(
% 0.09/0.37    equalish(b,d)|~sQ5_spl),
% 0.09/0.37    inference(component_clause,[status(thm)],[f50])).
% 0.09/0.37  fof(f53,plain,(
% 0.09/0.37    sQ4_spl|sQ5_spl),
% 0.09/0.37    inference(split_clause,[status(thm)],[f32,f47,f50])).
% 0.09/0.37  fof(f54,plain,(
% 0.09/0.37    less(a,d)|~sQ4_spl),
% 0.09/0.37    inference(resolution,[status(thm)],[f48,f24])).
% 0.09/0.37  fof(f58,plain,(
% 0.09/0.37    $false|~sQ4_spl),
% 0.09/0.37    inference(forward_subsumption_resolution,[status(thm)],[f54,f23])).
% 0.09/0.37  fof(f59,plain,(
% 0.09/0.37    ~sQ4_spl),
% 0.09/0.37    inference(contradiction_clause,[status(thm)],[f58])).
% 0.09/0.37  fof(f60,plain,(
% 0.09/0.37    equalish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),d)|~sQ5_spl),
% 0.09/0.37    inference(resolution,[status(thm)],[f51,f28])).
% 0.09/0.37  fof(f66,plain,(
% 0.09/0.37    less(a,d)|~sQ5_spl),
% 0.09/0.37    inference(resolution,[status(thm)],[f60,f14])).
% 0.09/0.37  fof(f69,plain,(
% 0.09/0.38    $false|~sQ5_spl),
% 0.09/0.38    inference(forward_subsumption_resolution,[status(thm)],[f66,f23])).
% 0.09/0.38  fof(f70,plain,(
% 0.09/0.38    ~sQ5_spl),
% 0.09/0.38    inference(contradiction_clause,[status(thm)],[f69])).
% 0.09/0.38  fof(f71,plain,(
% 0.09/0.38    $false),
% 0.09/0.38    inference(sat_refutation,[status(thm)],[f53,f59,f70])).
% 0.09/0.38  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.40  % Elapsed time: 0.033812 seconds
% 0.13/0.40  % CPU time: 0.048807 seconds
% 0.13/0.40  % Total memory used: 3.247 MB
% 0.13/0.40  % Net memory used: 3.195 MB
%------------------------------------------------------------------------------