↑ 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  : SWC048-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/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:26 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  : SWC048-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n011.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 07:51: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 Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.09/0.40  fof(f8,axiom,(
% 0.09/0.40    ssList(nil) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f59,axiom,(
% 0.09/0.40    (![U]: (( ~ ssList(U)| rearsegP(U,U) ) ))),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f82,axiom,(
% 0.09/0.40    (![U]: (( ~ rearsegP(nil,U)| ~ ssList(U)| nil = U ) ))),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f115,axiom,(
% 0.09/0.40    (![U,V]: (( U != V| ~ neq(U,V)| ~ ssList(V)| ~ ssList(U) ) ))),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f186,negated_conjecture,(
% 0.09/0.40    ssList(sk1) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f190,negated_conjecture,(
% 0.09/0.40    sk2 = sk4 ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f191,negated_conjecture,(
% 0.09/0.40    sk1 = sk3 ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f193,negated_conjecture,(
% 0.09/0.40    (![A]: (( nil = sk2| ~ ssList(A)| ~ neq(A,nil)| ~ rearsegP(sk2,A)| ~ rearsegP(sk1,A) ) ))),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f194,negated_conjecture,(
% 0.09/0.40    ( nil != sk1| neq(sk2,nil) ) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f196,negated_conjecture,(
% 0.09/0.40    ( nil = sk4| neq(sk3,nil) ) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f197,negated_conjecture,(
% 0.09/0.40    ( nil = sk4| rearsegP(sk4,sk3) ) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f199,negated_conjecture,(
% 0.09/0.40    ( nil = sk3| rearsegP(sk4,sk3) ) ),
% 0.09/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.40  fof(f207,plain,(
% 0.09/0.40    ssList(nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f8])).
% 0.09/0.40  fof(f258,plain,(
% 0.09/0.40    ![X0]: (~ssList(X0)|rearsegP(X0,X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f59])).
% 0.09/0.40  fof(f282,plain,(
% 0.09/0.40    ![X0]: (~rearsegP(nil,X0)|~ssList(X0)|nil=X0)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f82])).
% 0.09/0.40  fof(f320,plain,(
% 0.09/0.40    ![U]: ((![V]: ((~U=V|~neq(U,V))|~ssList(V)))|~ssList(U))),
% 0.09/0.40    inference(miniscoping,[status(thm)],[f115])).
% 0.09/0.40  fof(f321,plain,(
% 0.09/0.40    ![X0,X1]: (~X0=X1|~neq(X0,X1)|~ssList(X1)|~ssList(X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f320])).
% 0.09/0.40  fof(f430,plain,(
% 0.09/0.40    ssList(sk1)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f186])).
% 0.09/0.40  fof(f434,plain,(
% 0.09/0.40    sk2=sk4),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f190])).
% 0.09/0.40  fof(f435,plain,(
% 0.09/0.40    sk1=sk3),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f191])).
% 0.09/0.40  fof(f437,plain,(
% 0.09/0.40    ![X0]: (nil=sk2|~ssList(X0)|~neq(X0,nil)|~rearsegP(sk2,X0)|~rearsegP(sk1,X0))),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f193])).
% 0.09/0.40  fof(f438,plain,(
% 0.09/0.40    ~nil=sk1|neq(sk2,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f194])).
% 0.09/0.40  fof(f440,plain,(
% 0.09/0.40    nil=sk4|neq(sk3,nil)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f196])).
% 0.09/0.40  fof(f441,plain,(
% 0.09/0.40    nil=sk4|rearsegP(sk4,sk3)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f197])).
% 0.09/0.40  fof(f443,plain,(
% 0.09/0.40    nil=sk3|rearsegP(sk4,sk3)),
% 0.09/0.40    inference(cnf_transformation,[status(thm)],[f199])).
% 0.09/0.40  fof(f451,plain,(
% 0.09/0.40    ![X1]: (~neq(X1,X1)|~ssList(X1)|~ssList(X1))),
% 0.09/0.40    inference(destructive_equality_resolution,[status(thm)],[f321])).
% 0.09/0.40  fof(f452,plain,(
% 0.09/0.40    ![X0]: (~neq(X0,X0)|~ssList(X0))),
% 0.09/0.40    inference(duplicate_literals_removal,[status(thm)],[f451])).
% 0.09/0.40  fof(f497,plain,(
% 0.09/0.40    nil=sk2|neq(sk3,nil)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f434,f440])).
% 0.09/0.40  fof(f498,plain,(
% 0.09/0.40    nil=sk2|neq(sk1,nil)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f435,f497])).
% 0.09/0.40  fof(f499,plain,(
% 0.09/0.40    nil=sk2|rearsegP(sk4,sk3)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f434,f441])).
% 0.09/0.40  fof(f500,plain,(
% 0.09/0.40    nil=sk2|rearsegP(sk2,sk3)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f434,f499])).
% 0.09/0.40  fof(f501,plain,(
% 0.09/0.40    nil=sk2|rearsegP(sk2,sk1)),
% 0.09/0.40    inference(forward_demodulation,[status(thm)],[f435,f500])).
% 0.09/0.40  fof(f503,plain,(
% 0.09/0.40    nil=sk2|nil=sk2|~ssList(sk1)|~neq(sk1,nil)|~rearsegP(sk1,sk1)),
% 0.09/0.40    inference(resolution,[status(thm)],[f501,f437])).
% 0.09/0.40  fof(f506,plain,(
% 0.09/0.40    nil=sk2|~ssList(sk1)|~neq(sk1,nil)|~rearsegP(sk1,sk1)),
% 0.09/0.40    inference(duplicate_literals_removal,[status(thm)],[f503])).
% 0.09/0.41  fof(f507,plain,(
% 0.09/0.41    nil=sk2|~neq(sk1,nil)|~rearsegP(sk1,sk1)),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f506,f430])).
% 0.09/0.41  fof(f533,plain,(
% 0.09/0.41    nil=sk1|rearsegP(sk4,sk3)),
% 0.09/0.41    inference(forward_demodulation,[status(thm)],[f435,f443])).
% 0.09/0.41  fof(f534,plain,(
% 0.09/0.41    nil=sk1|rearsegP(sk2,sk3)),
% 0.09/0.41    inference(forward_demodulation,[status(thm)],[f434,f533])).
% 0.09/0.41  fof(f535,plain,(
% 0.09/0.41    nil=sk1|rearsegP(sk2,sk1)),
% 0.09/0.41    inference(forward_demodulation,[status(thm)],[f435,f534])).
% 0.09/0.41  fof(f570,plain,(
% 0.09/0.41    nil=sk2|~rearsegP(sk1,sk1)),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f507,f498])).
% 0.09/0.41  fof(f572,plain,(
% 0.09/0.41    nil=sk2|~ssList(sk1)),
% 0.09/0.41    inference(resolution,[status(thm)],[f570,f258])).
% 0.09/0.41  fof(f575,plain,(
% 0.09/0.41    nil=sk2),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f572,f430])).
% 0.09/0.41  fof(f589,plain,(
% 0.09/0.41    nil=sk1|rearsegP(nil,sk1)),
% 0.09/0.41    inference(backward_demodulation,[status(thm)],[f575,f535])).
% 0.09/0.41  fof(f594,plain,(
% 0.09/0.41    ~nil=sk1|neq(nil,nil)),
% 0.09/0.41    inference(backward_demodulation,[status(thm)],[f575,f438])).
% 0.09/0.41  fof(f598,plain,(
% 0.09/0.41    nil=sk1|~ssList(sk1)|nil=sk1),
% 0.09/0.41    inference(resolution,[status(thm)],[f589,f282])).
% 0.09/0.41  fof(f601,plain,(
% 0.09/0.41    nil=sk1|~ssList(sk1)),
% 0.09/0.41    inference(duplicate_literals_removal,[status(thm)],[f598])).
% 0.09/0.41  fof(f602,plain,(
% 0.09/0.41    nil=sk1),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f601,f430])).
% 0.09/0.41  fof(f614,plain,(
% 0.09/0.41    ~nil=sk1|~ssList(nil)),
% 0.09/0.41    inference(resolution,[status(thm)],[f594,f452])).
% 0.09/0.41  fof(f615,plain,(
% 0.09/0.41    ~nil=sk1),
% 0.09/0.41    inference(forward_subsumption_resolution,[status(thm)],[f614,f207])).
% 0.09/0.41  fof(f628,plain,(
% 0.09/0.41    ~nil=nil),
% 0.09/0.41    inference(forward_demodulation,[status(thm)],[f602,f615])).
% 0.09/0.41  fof(f629,plain,(
% 0.09/0.41    $false),
% 0.09/0.41    inference(trivial_equality_resolution,[status(thm)],[f628])).
% 0.09/0.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.42  % Elapsed time: 0.057138 seconds
% 0.09/0.42  % CPU time: 0.191966 seconds
% 0.09/0.42  % Total memory used: 109.200 MB
% 0.09/0.42  % Net memory used: 109.030 MB
%------------------------------------------------------------------------------