%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:15:08 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 61 ( 14 unt; 7 def)
% Number of atoms : 118 ( 39 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 102 ( 45 ~; 50 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 19 ( 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X,Y] :
! [Z] :
( Z = Y
| Z = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
big_p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
big_p(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
! [X] : big_p(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ! [X] : big_p(X),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [Z] :
( Z = sK1_skl
| Z = sK0_skl ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(Y,sK1_skl)],[f1]) ).
fof(f8,plain,
! [X0] :
( X0 = sK1_skl
| X0 = sK0_skl ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
big_p(a),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
big_p(b),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f11,plain,
a != b,
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f12,plain,
? [X] : ~ big_p(X),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f13,plain,
~ big_p(sK2_skl),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(X,sK2_skl)],[f12]) ).
fof(f14,plain,
~ big_p(sK2_skl),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( X1 = sK0_skl
| X0 = X1
| X0 = sK0_skl ),
inference(paramodulation,[status(thm)],[f8,f8]) ).
fof(f16,plain,
! [X0] :
( X0 = sK0_skl
| sK1_skl != sK0_skl ),
inference(equality_factoring,[status(thm)],[f8]) ).
fof(f17,definition,
( sQ0_spl
<=> sK1_skl = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f20,definition,
! [X0] :
( sQ1_spl
<=> X0 = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f21,plain,
! [X0] :
( ~ sQ1_spl
| X0 = sK0_skl ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f16,f17,f20]) ).
fof(f24,plain,
( b = sK0_skl
| a != sK1_skl ),
inference(paramodulation,[status(thm)],[f8,f11]) ).
fof(f25,definition,
( sQ2_spl
<=> a = sK1_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f27,plain,
( sQ2_spl
| a != sK1_skl ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,definition,
( sQ3_spl
<=> b = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f29,plain,
( ~ sQ3_spl
| b = sK0_skl ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f30,plain,
( sQ3_spl
| b != sK0_skl ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f24,f25,f28]) ).
fof(f35,plain,
( sQ2_spl
| a = sK0_skl
| sK1_skl != sK1_skl ),
inference(paramodulation,[status(thm)],[f8,f27]) ).
fof(f36,definition,
( sQ4_spl
<=> sK1_skl = sK1_skl ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f38,plain,
( sQ4_spl
| sK1_skl != sK1_skl ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,definition,
( sQ5_spl
<=> a = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f40,plain,
( ~ sQ5_spl
| a = sK0_skl ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( sQ2_spl
| sQ5_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f35,f36,f39,f25]) ).
fof(f43,plain,
( ~ sQ3_spl
| a != sK0_skl ),
inference(backward_demodulation,[status(thm)],[f29,f11]) ).
fof(f44,plain,
( ~ sQ3_spl
| big_p(sK0_skl) ),
inference(backward_demodulation,[status(thm)],[f29,f10]) ).
fof(f47,plain,
( ~ sQ5_spl
| big_p(sK0_skl) ),
inference(backward_demodulation,[status(thm)],[f40,f9]) ).
fof(f50,plain,
( ~ sQ3_spl
| ~ sQ5_spl
| sK0_skl != sK0_skl ),
inference(forward_demodulation,[status(thm)],[f40,f43]) ).
fof(f51,plain,
( ~ sQ3_spl
| ~ sQ5_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f50]) ).
fof(f52,plain,
( ~ sQ3_spl
| ~ sQ5_spl ),
inference(contradiction_clause,[status(thm)],[f51]) ).
fof(f53,plain,
( sQ4_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f38]) ).
fof(f54,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f55,plain,
( a = sK0_skl
| big_p(sK1_skl) ),
inference(paramodulation,[status(thm)],[f8,f9]) ).
fof(f56,definition,
( sQ6_spl
<=> big_p(sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f57,plain,
( ~ sQ6_spl
| big_p(sK1_skl) ),
inference(component_clause,[status(thm)],[f56]) ).
fof(f59,plain,
( sQ5_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f55,f56,f39]) ).
fof(f70,plain,
! [X0,X1] :
( ~ sQ1_spl
| X0 = X1 ),
inference(paramodulation,[status(thm)],[f21,f21]) ).
fof(f71,plain,
! [X0] :
( ~ sQ1_spl
| big_p(X0) ),
inference(paramodulation,[status(thm)],[f70,f10]) ).
fof(f73,plain,
( ~ sQ1_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f14,f71]) ).
fof(f74,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f73]) ).
fof(f80,plain,
! [X0] :
( sQ3_spl
| X0 = b
| X0 = sK0_skl ),
inference(resolution,[status(thm)],[f15,f30]) ).
fof(f109,plain,
! [X0] :
( sQ3_spl
| X0 = sK0_skl
| big_p(X0) ),
inference(paramodulation,[status(thm)],[f80,f10]) ).
fof(f154,plain,
( sQ3_spl
| sK2_skl = sK0_skl ),
inference(resolution,[status(thm)],[f109,f14]) ).
fof(f155,plain,
( sQ3_spl
| ~ big_p(sK0_skl) ),
inference(backward_demodulation,[status(thm)],[f154,f14]) ).
fof(f156,plain,
( sQ3_spl
| ~ sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f155,f47]) ).
fof(f157,plain,
( sQ3_spl
| ~ sQ5_spl ),
inference(contradiction_clause,[status(thm)],[f156]) ).
fof(f166,plain,
! [X0] :
( ~ sQ3_spl
| X0 = sK1_skl
| big_p(X0) ),
inference(paramodulation,[status(thm)],[f8,f44]) ).
fof(f190,plain,
( ~ sQ3_spl
| sK2_skl = sK1_skl ),
inference(resolution,[status(thm)],[f166,f14]) ).
fof(f191,plain,
( ~ sQ3_spl
| ~ big_p(sK1_skl) ),
inference(backward_demodulation,[status(thm)],[f190,f14]) ).
fof(f193,plain,
( ~ sQ3_spl
| ~ sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f191,f57]) ).
fof(f194,plain,
( ~ sQ3_spl
| ~ sQ6_spl ),
inference(contradiction_clause,[status(thm)],[f193]) ).
fof(f195,plain,
$false,
inference(sat_refutation,[status(thm)],[f23,f31,f42,f52,f54,f59,f74,f157,f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n008.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 10:43:09 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.44 % Drodi V4.1.1
% 0.17/0.47 % Refutation found
% 0.17/0.47 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.50 % Elapsed time: 0.063244 seconds
% 0.17/0.50 % CPU time: 0.179225 seconds
% 0.17/0.50 % Total memory used: 65.006 MB
% 0.17/0.50 % Net memory used: 64.594 MB
%------------------------------------------------------------------------------