%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR051+2 : 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 : n016.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 3.70s 6.31s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 8 !; 2 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_51) ).
fof(f986,axiom,
! [X0] :
( marriagelicensedocument(X0)
=> isa(X0,c_marriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_986) ).
fof(f1132,conjecture,
? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query101) ).
fof(f1133,negated_conjecture,
~ ? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
inference(negated_conjecture,[status(cth)],[f1132]) ).
fof(f1251,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(ennf_transformation,[],[f51]) ).
fof(f1872,plain,
! [X0] :
( ~ marriagelicensedocument(X0)
| isa(X0,c_marriagelicensedocument) ),
inference(ennf_transformation,[],[f986]) ).
fof(f2022,plain,
! [X0] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X0) ),
inference(ennf_transformation,[],[f1133]) ).
fof(f2073,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f1251]) ).
fof(f2926,plain,
! [X0] :
( ~ marriagelicensedocument(X0)
| isa(X0,c_marriagelicensedocument) ),
inference(cnf_transformation,[],[f1872]) ).
fof(f3062,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f2022]) ).
fof(f3063,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f2022]) ).
tcf(c_99,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f2073]) ).
tcf(c_952,plain,
! [X0: $i] :
( isa(X0,c_marriagelicensedocument)
| ~ marriagelicensedocument(X0) ),
inference(cnf_transformation,[],[f2926]) ).
tcf(c_1088,negated_conjecture,
! [X0: $i] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f3063]) ).
tcf(c_1089,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f3062]) ).
tcf(c_1725,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(global_subsumption_just,[status(thm)],[c_99,c_1089,c_99]) ).
tcf(c_1727,plain,
! [X0: $i] : ~ marriagelicensedocument(X0),
inference(global_subsumption_just,[status(thm)],[c_952,c_1088]) ).
tcf(c_5409,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1725,c_1727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.38 % Computer : n016.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Fri Sep 25 08:41:07 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.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...
% 3.70/6.31 % SZS status Started for theBenchmark.p
% 3.70/6.31 % SZS status Theorem for theBenchmark.p
% 3.70/6.31
% 3.70/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.70/6.31
% 3.70/6.31 % ------ iProver source info
% 3.70/6.31
% 3.70/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.70/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.70/6.31 % git: non_committed_changes: false
% 3.70/6.31
% 3.70/6.31 % ------ Parsing...
% 3.70/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.70/6.31
% 3.70/6.31 % ------ Preprocessing...%
% 3.70/6.31
% 3.70/6.31 % SZS status Theorem for theBenchmark.p
% 3.70/6.31
% 3.70/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/6.31
% 3.70/6.31
%------------------------------------------------------------------------------