TSTP Solution File: LCL542+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL542+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 : Thu Aug 31 07:44:58 EDT 2023
% Result : Theorem 2.47s 1.15s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 19 unt; 0 def)
% Number of atoms : 70 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 25 ~; 18 |; 0 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn; 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessitation) ).
fof(f64,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m2) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f89,conjecture,
axiom_m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f90,negated_conjecture,
~ axiom_m2,
inference(negated_conjecture,[],[f89]) ).
fof(f105,plain,
~ axiom_m2,
inference(flattening,[],[f90]) ).
fof(f106,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
=> axiom_m2 ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f111,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f120,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f138,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f120]) ).
fof(f150,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f111]) ).
fof(f155,plain,
( axiom_m2
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f106]) ).
fof(f157,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f159,plain,
( ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0))
=> ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f155,f159]) ).
fof(f167,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f138]) ).
fof(f187,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f197,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f150]) ).
fof(f202,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f160]) ).
fof(f204,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f157]) ).
fof(f207,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f214,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f217,plain,
~ axiom_m2,
inference(cnf_transformation,[],[f105]) ).
cnf(c_55,plain,
( ~ and_1
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_75,plain,
and_1,
inference(cnf_transformation,[],[f187]) ).
cnf(c_85,plain,
( ~ is_a_theorem(X0)
| ~ necessitation
| is_a_theorem(necessarily(X0)) ),
inference(cnf_transformation,[],[f197]) ).
cnf(c_90,plain,
( ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0))
| axiom_m2 ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_92,plain,
( ~ op_strict_implies
| necessarily(implies(X0,X1)) = strict_implies(X0,X1) ),
inference(cnf_transformation,[],[f204]) ).
cnf(c_95,plain,
necessitation,
inference(cnf_transformation,[],[f207]) ).
cnf(c_102,plain,
op_strict_implies,
inference(cnf_transformation,[],[f214]) ).
cnf(c_105,negated_conjecture,
~ axiom_m2,
inference(cnf_transformation,[],[f217]) ).
cnf(c_134,plain,
~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)),
inference(global_subsumption_just,[status(thm)],[c_90,c_105,c_90]) ).
cnf(c_139,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_85,c_95,c_85]) ).
cnf(c_150,plain,
is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_55,c_75,c_55]) ).
cnf(c_169,plain,
necessarily(implies(X0,X1)) = strict_implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_92,c_102,c_92]) ).
cnf(c_673,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_169,c_139]) ).
cnf(c_725,plain,
is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(superposition,[status(thm)],[c_150,c_673]) ).
cnf(c_742,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_134,c_725]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL542+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.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 Aug 24 18:20:39 EDT 2023
% 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 --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.47/1.15 % SZS status Started for theBenchmark.p
% 2.47/1.15 % SZS status Theorem for theBenchmark.p
% 2.47/1.15
% 2.47/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.47/1.15
% 2.47/1.15 ------ iProver source info
% 2.47/1.15
% 2.47/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.47/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.47/1.15 git: non_committed_changes: false
% 2.47/1.15 git: last_make_outside_of_git: false
% 2.47/1.15
% 2.47/1.15 ------ Parsing...
% 2.47/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... sup_sim: 3 sf_s rm: 28 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.47/1.15 ------ Proving...
% 2.47/1.15 ------ Problem Properties
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 clauses 27
% 2.47/1.15 conjectures 0
% 2.47/1.15 EPR 0
% 2.47/1.15 Horn 27
% 2.47/1.15 unary 24
% 2.47/1.15 binary 2
% 2.47/1.15 lits 31
% 2.47/1.15 lits eq 7
% 2.47/1.15 fd_pure 0
% 2.47/1.15 fd_pseudo 0
% 2.47/1.15 fd_cond 0
% 2.47/1.15 fd_pseudo_cond 1
% 2.47/1.15 AC symbols 0
% 2.47/1.15
% 2.47/1.15 ------ Schedule dynamic 5 is on
% 2.47/1.15
% 2.47/1.15 ------ no conjectures: strip conj schedule
% 2.47/1.15
% 2.47/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 ------
% 2.47/1.15 Current options:
% 2.47/1.15 ------
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 ------ Proving...
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 % SZS status Theorem for theBenchmark.p
% 2.47/1.15
% 2.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.16
% 2.47/1.16
%------------------------------------------------------------------------------