%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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 12:13:10 PM UTC 2026
% Result : Theorem 0.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 5 ( 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f28,conjecture,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,negated_conjecture,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f30,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f31,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f103,plain,
! [X] :
( ~ marriagelicensedocument(X)
& mtvisible(c_tptp_member3356_mt) ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f104,plain,
( ! [X] : ~ marriagelicensedocument(X)
& mtvisible(c_tptp_member3356_mt) ),
inference(miniscoping,[status(thm)],[f103]) ).
fof(f105,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[status(thm)],[f104]) ).
fof(f106,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[status(thm)],[f104]) ).
fof(f107,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(forward_subsumption_resolution,[status(thm)],[f31,f105]) ).
fof(f108,plain,
$false,
inference(resolution,[status(thm)],[f107,f106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n007.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 14:34:05 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.35 % Drodi V4.1.1
% 0.07/0.36 % Refutation found
% 0.07/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.041701 seconds
% 0.13/0.39 % CPU time: 0.059589 seconds
% 0.13/0.39 % Total memory used: 1.750 MB
% 0.13/0.39 % Net memory used: 1.735 MB
%------------------------------------------------------------------------------