%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR051+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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:14 PM UTC 2026
% Result : Theorem 4.28s 6.32s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 10 ~; 6 |; 1 &)
% ( 0 <=>; 4 =>; 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 : 5 ( 0 sgn 3 !; 2 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f395,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_395) ).
fof(f3147,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_3147) ).
fof(f8006,conjecture,
? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query151) ).
fof(f8007,negated_conjecture,
~ ? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
inference(negated_conjecture,[status(cth)],[f8006]) ).
fof(f8009,plain,
! [X0] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X0) ),
inference(ennf_transformation,[],[f8007]) ).
fof(f8012,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(ennf_transformation,[],[f3147]) ).
fof(f8013,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(ennf_transformation,[],[f395]) ).
fof(f8016,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f8009]) ).
fof(f8017,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f8009]) ).
fof(f8019,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f8012]) ).
fof(f8020,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f8013]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f8017]) ).
tcf(c_50,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f8016]) ).
tcf(c_52,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f8019]) ).
tcf(c_53,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f8020]) ).
tcf(c_65,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_53]) ).
tcf(c_67,plain,
$false,
inference(resolution,[status(thm)],[c_65,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR051+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n005.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Fri Sep 25 08:36:07 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 4.28/6.32 % SZS status Started for theBenchmark.p
% 4.28/6.32 % SZS status Theorem for theBenchmark.p
% 4.28/6.32
% 4.28/6.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.28/6.32
% 4.28/6.32 % ------ iProver source info
% 4.28/6.32
% 4.28/6.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.28/6.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.28/6.32 % git: non_committed_changes: false
% 4.28/6.32
% 4.28/6.32 % ------ Parsing...
% 4.28/6.32 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 4.28/6.32 %
% 4.28/6.32
% 4.28/6.32 % ------ Preprocessing... sf_s rm: 9 0s sf_e sf_s rm: 0 0s sf_e %
% 4.28/6.32
% 4.28/6.32 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 4.28/6.32 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.28/6.32 % ------ Proving...
% 4.28/6.32 % ------ Problem Properties
% 4.28/6.32
% 4.28/6.32 %
% 4.28/6.32 % clauses 2
% 4.28/6.32 % conjectures 1
% 4.28/6.32 % EPR 2
% 4.28/6.32 % Horn 2
% 4.28/6.32 % unary 2
% 4.28/6.32 % binary 0
% 4.28/6.32 % lits 2
% 4.28/6.32 % lits eq 0
% 4.28/6.32 % fd_pure 0
% 4.28/6.32 % fd_pseudo 0
% 4.28/6.32 % fd_cond 0
% 4.28/6.32 % fd_pseudo_cond 0
% 4.28/6.32 % AC symbols 0
% 4.28/6.32
% 4.28/6.32 % ------ Schedule EPR Horn non eq is on
% 4.28/6.32
% 4.28/6.32 % ------ no equalities: superposition off
% 4.28/6.32
% 4.28/6.32 % ------ Option_epr_horn Time Limit: Unbounded
% 4.28/6.32
% 4.28/6.32
% 4.28/6.32 % ------
% 4.28/6.32 % Current options:
% 4.28/6.32 % ------
% 4.28/6.32
% 4.28/6.32
% 4.28/6.32 %
% 4.28/6.32
% 4.28/6.32 % ------ Proving...
% 4.28/6.32 %
% 4.28/6.32
% 4.28/6.32 % SZS status Theorem for theBenchmark.p
% 4.28/6.32
% 4.28/6.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.28/6.32
% 4.28/6.32
%------------------------------------------------------------------------------