TSTP Solution File: CSR051+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 : Fri May 3 02:11:28 EDT 2024
% Result : Theorem 1.87s 1.11s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 6 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 12 ( 2 sgn 6 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_51) ).
fof(f986,axiom,
! [X12] :
( marriagelicensedocument(X12)
=> isa(X12,c_marriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_986) ).
fof(f1132,conjecture,
? [X12] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query101) ).
fof(f1133,negated_conjecture,
~ ? [X12] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X12) ),
inference(negated_conjecture,[],[f1132]) ).
fof(f1652,plain,
! [X0] :
( marriagelicensedocument(X0)
=> isa(X0,c_marriagelicensedocument) ),
inference(rectify,[],[f986]) ).
fof(f1796,plain,
~ ? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
inference(rectify,[],[f1133]) ).
fof(f1914,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(ennf_transformation,[],[f51]) ).
fof(f2535,plain,
! [X0] :
( isa(X0,c_marriagelicensedocument)
| ~ marriagelicensedocument(X0) ),
inference(ennf_transformation,[],[f1652]) ).
fof(f2685,plain,
! [X0] :
( ~ marriagelicensedocument(X0)
& mtvisible(c_tptp_member3356_mt) ),
inference(ennf_transformation,[],[f1796]) ).
fof(f2736,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f1914]) ).
fof(f3589,plain,
! [X0] :
( isa(X0,c_marriagelicensedocument)
| ~ marriagelicensedocument(X0) ),
inference(cnf_transformation,[],[f2535]) ).
fof(f3725,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f2685]) ).
fof(f3726,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f2685]) ).
cnf(c_99,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f2736]) ).
cnf(c_952,plain,
( ~ marriagelicensedocument(X0)
| isa(X0,c_marriagelicensedocument) ),
inference(cnf_transformation,[],[f3589]) ).
cnf(c_1088,negated_conjecture,
~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f3726]) ).
cnf(c_1089,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f3725]) ).
cnf(c_1725,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(global_subsumption_just,[status(thm)],[c_99,c_1089,c_99]) ).
cnf(c_1727,plain,
~ marriagelicensedocument(X0),
inference(global_subsumption_just,[status(thm)],[c_952,c_1088]) ).
cnf(c_5409,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1725,c_1727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 23:11:41 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.87/1.11 % SZS status Started for theBenchmark.p
% 1.87/1.11 % SZS status Theorem for theBenchmark.p
% 1.87/1.11
% 1.87/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.87/1.11
% 1.87/1.11 ------ iProver source info
% 1.87/1.11
% 1.87/1.11 git: date: 2024-05-02 19:28:25 +0000
% 1.87/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.87/1.11 git: non_committed_changes: false
% 1.87/1.11
% 1.87/1.11 ------ Parsing...
% 1.87/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.87/1.11
% 1.87/1.11 ------ Preprocessing...
% 1.87/1.11
% 1.87/1.11 % SZS status Theorem for theBenchmark.p
% 1.87/1.11
% 1.87/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.87/1.11
% 1.87/1.11
%------------------------------------------------------------------------------