%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n026.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 : Fri Sep 25 01:10:13 PM UTC 2026
% Result : Theorem 1.14s 1.28s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 3 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 6 ( 0 sgn 4 !; 2 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(f28,conjecture,
? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query51) ).
fof(f29,negated_conjecture,
~ ? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f41,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(ennf_transformation,[],[f1]) ).
fof(f60,plain,
! [X0] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f61,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f41]) ).
fof(f77,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f60]) ).
fof(f78,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f60]) ).
tcf(c_49,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f78]) ).
tcf(c_66,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f77]) ).
tcf(c_73,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(global_subsumption_just,[status(thm)],[c_49,c_66,c_49]) ).
tcf(c_80,negated_conjecture,
! [X0: $i] : ~ marriagelicensedocument(X0),
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_81,plain,
$false,
inference(resolution,[status(thm)],[c_73,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 08:38:25 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 1.14/1.28 % SZS status Started for theBenchmark.p
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.14/1.28
% 1.14/1.28 % ------ iProver source info
% 1.14/1.28
% 1.14/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.14/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.14/1.28 % git: non_committed_changes: false
% 1.14/1.28
% 1.14/1.28 % ------ Parsing...
% 1.14/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.14/1.28 %
% 1.14/1.28
% 1.14/1.28 % ------ Preprocessing... sf_s rm: 12 0s sf_e sf_s rm: 0 0s sf_e %
% 1.14/1.28
% 1.14/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.14/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.14/1.28 % ------ Proving...
% 1.14/1.28 % ------ Problem Properties
% 1.14/1.28
% 1.14/1.28 %
% 1.14/1.28 % clauses 2
% 1.14/1.28 % conjectures 1
% 1.14/1.28 % EPR 2
% 1.14/1.28 % Horn 2
% 1.14/1.28 % unary 2
% 1.14/1.28 % binary 0
% 1.14/1.28 % lits 2
% 1.14/1.28 % lits eq 0
% 1.14/1.28 % fd_pure 0
% 1.14/1.28 % fd_pseudo 0
% 1.14/1.28 % fd_cond 0
% 1.14/1.28 % fd_pseudo_cond 0
% 1.14/1.28 % AC symbols 0
% 1.14/1.28
% 1.14/1.28 % ------ Schedule EPR Horn non eq is on
% 1.14/1.28
% 1.14/1.28 % ------ no equalities: superposition off
% 1.14/1.28
% 1.14/1.28 % ------ Option_epr_horn Time Limit: Unbounded
% 1.14/1.28
% 1.14/1.28
% 1.14/1.28 % ------
% 1.14/1.28 % Current options:
% 1.14/1.28 % ------
% 1.14/1.28
% 1.14/1.28
% 1.14/1.28 %
% 1.14/1.28
% 1.14/1.28 % ------ Proving...
% 1.14/1.28 %
% 1.14/1.28
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.14/1.28
% 1.14/1.28
%------------------------------------------------------------------------------