TSTP Solution File: CSR051+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR051+1 : 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 0.49s 1.17s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 3 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 7 ( 2 sgn 2 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).
fof(f28,conjecture,
? [X9] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query51) ).
fof(f29,negated_conjecture,
~ ? [X9] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X9) ),
inference(negated_conjecture,[],[f28]) ).
fof(f54,plain,
~ ? [X0] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X0) ),
inference(rectify,[],[f29]) ).
fof(f66,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(ennf_transformation,[],[f1]) ).
fof(f85,plain,
! [X0] :
( ~ marriagelicensedocument(X0)
& mtvisible(c_tptp_member3356_mt) ),
inference(ennf_transformation,[],[f54]) ).
fof(f86,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(cnf_transformation,[],[f66]) ).
fof(f102,plain,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f85]) ).
fof(f103,plain,
! [X0] : ~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f85]) ).
cnf(c_49,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_65,negated_conjecture,
~ marriagelicensedocument(X0),
inference(cnf_transformation,[],[f103]) ).
cnf(c_66,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(cnf_transformation,[],[f102]) ).
cnf(c_73,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(global_subsumption_just,[status(thm)],[c_49,c_66,c_49]) ).
cnf(c_80,negated_conjecture,
~ marriagelicensedocument(X0),
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_81,plain,
$false,
inference(resolution,[status(thm)],[c_73,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 22:55:11 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 0.49/1.17 % SZS status Started for theBenchmark.p
% 0.49/1.17 % SZS status Theorem for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17
% 0.49/1.17 ------ iProver source info
% 0.49/1.17
% 0.49/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.49/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.49/1.17 git: non_committed_changes: false
% 0.49/1.17
% 0.49/1.17 ------ Parsing...
% 0.49/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sf_s rm: 12 0s sf_e sf_s rm: 0 0s sf_e
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.49/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.17 ------ Proving...
% 0.49/1.17 ------ Problem Properties
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 clauses 2
% 0.49/1.17 conjectures 1
% 0.49/1.17 EPR 2
% 0.49/1.17 Horn 2
% 0.49/1.17 unary 2
% 0.49/1.17 binary 0
% 0.49/1.17 lits 2
% 0.49/1.17 lits eq 0
% 0.49/1.17 fd_pure 0
% 0.49/1.17 fd_pseudo 0
% 0.49/1.17 fd_cond 0
% 0.49/1.17 fd_pseudo_cond 0
% 0.49/1.17 AC symbols 0
% 0.49/1.17
% 0.49/1.17 ------ Schedule EPR Horn non eq is on
% 0.49/1.17
% 0.49/1.17 ------ no equalities: superposition off
% 0.49/1.17
% 0.49/1.17 ------ Option_epr_horn Time Limit: Unbounded
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------
% 0.49/1.17 Current options:
% 0.49/1.17 ------
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Proving...
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 % SZS status Theorem for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17
% 0.49/1.17
%------------------------------------------------------------------------------