%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR051+3 : TPTP v9.2.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:14:28 PM UTC 2026
% Result : Theorem 4.24s 3.66s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 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 : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query151,conjecture,
? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query151) ).
fof(ax2_395,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_395) ).
fof(c_0_2,negated_conjecture,
~ ? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
inference(assume_negation,[status(cth)],[query151]) ).
fof(c_0_3,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(fof_nnf,[status(thm)],[ax2_395]) ).
fof(c_0_4,negated_conjecture,
! [X11964] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X11964) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_5,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ marriagelicensedocument(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR051+3 : TPTP v9.2.1. Released v3.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 16:35:36 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 4.24/3.66 % Version : CSE_E---1.7
% 4.24/3.66 % Problem : theBenchmark.p
% 4.24/3.66 % SZS status Theorem for theBenchmark.p
% 4.24/3.66 % SZS output start CNFRefutation
% See solution above
% 4.24/3.66 % Total time : 3.020s
%------------------------------------------------------------------------------