%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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.67s 0.64s
% Output : CNFRefutation 0.67s
% 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(ax1_51,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('theBenchmark.p',ax1_51) ).
fof(query101,conjecture,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('theBenchmark.p',query101) ).
fof(query101_neg,negated_conjecture,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(assume_negation,[status(cth)],[query101]) ).
cnf(c_1983,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(clausify,[status(thm)],[ax1_51]) ).
cnf(c_1988,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(clausify,[status(thm)],[query101_neg]) ).
cnf(c_1989,negated_conjecture,
~ marriagelicensedocument(A),
inference(clausify,[status(thm)],[query101_neg]) ).
cnf(c_1991,negated_conjecture,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(resolve,[status(thm)],[c_1988,c_1983]) ).
cnf(c_1990,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1989,c_1991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n014.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 : Sun Sep 27 00:19:31 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35 % Process 217914 was started by sandbox on n014,
% 0.07/0.35 % Sun Sep 27 00:19:31 2026
% 0.07/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.21/0.51
% 0.21/0.51 % From the command line: assign(max_seconds, 300).
% 0.21/0.51
% 0.21/0.51 % SInE: 5 to sos, 1126 to usable, of 1131 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.67/0.64
% 0.67/0.64 % SZS status Theorem for theBenchmark
% 0.67/0.64
% 0.67/0.64 % Proof 1 at 0.05 (+ 0.03) seconds.
% 0.67/0.64 % Length of proof is 6.
% 0.67/0.64 % Level of proof is 2.
% 0.67/0.64 % Maximum clause weight is 9.000.
% 0.67/0.64 % Given clauses 0.
% 0.67/0.64
% 0.67/0.64 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------