%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR051+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Sun Sep 27 07:06:53 AM UTC 2026
% Result : Theorem 0.41s 0.79s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 3 ( 1 sgn 0 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax3_12494,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('theBenchmark.p',ax3_12494) ).
fof(query201,conjecture,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('theBenchmark.p',query201) ).
fof(query201_neg,negated_conjecture,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(assume_negation,[status(cth)],[query201]) ).
cnf(c_16,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(clausify,[status(thm)],[ax3_12494]) ).
cnf(c_24,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(clausify,[status(thm)],[query201_neg]) ).
cnf(c_25,negated_conjecture,
~ marriagelicensedocument(A),
inference(clausify,[status(thm)],[query201_neg]) ).
cnf(c_27,negated_conjecture,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(resolve,[status(thm)],[c_24,c_16]) ).
cnf(c_26,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_25,c_27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR051+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 00:19:21 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 2946897 was started by sandbox2 on n004,
% 0.12/0.36 % Sun Sep 27 00:19:21 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.41/0.79
% 0.41/0.79 % SInE (scan): 14 to sos (tol 1.5x), 2 to usable (tol 2.0x), 44200 zapped, of 44216 axioms (depth 3).
% 0.41/0.79
% 0.41/0.79 % From the command line: assign(max_seconds, 300).
% 0.41/0.79
% 0.41/0.79 % SZS status Theorem for theBenchmark
% 0.41/0.79
% 0.41/0.79 % Proof 1 at 0.03 (+ 0.04) seconds.
% 0.41/0.79 % Length of proof is 6.
% 0.41/0.79 % Level of proof is 2.
% 0.41/0.79 % Maximum clause weight is 9.000.
% 0.41/0.79 % Given clauses 0.
% 0.41/0.79
% 0.41/0.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------