TSTP Solution File: LCL531+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL531+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:55 EDT 2023
% Result : Theorem 2.97s 1.17s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 27 unt; 0 def)
% Number of atoms : 120 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 101 ( 45 ~; 38 |; 2 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn; 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f66,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m4) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_necessitation) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f89,negated_conjecture,
~ axiom_m4,
inference(negated_conjecture,[],[f88]) ).
fof(f104,plain,
~ axiom_m4,
inference(flattening,[],[f89]) ).
fof(f105,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
=> axiom_m4 ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f109,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f116,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f120,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f124,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f129,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f124]) ).
fof(f130,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f129]) ).
fof(f134,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f120]) ).
fof(f138,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f116]) ).
fof(f148,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f109]) ).
fof(f152,plain,
( axiom_m4
| ? [X0] : ~ is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f105]) ).
fof(f154,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f156,plain,
( ? [X0] : ~ is_a_theorem(strict_implies(X0,and(X0,X0)))
=> ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f152,f156]) ).
fof(f158,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f130]) ).
fof(f162,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f166,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f138]) ).
fof(f179,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f182,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f186,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f194,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f148]) ).
fof(f198,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(cnf_transformation,[],[f157]) ).
fof(f200,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f154]) ).
fof(f203,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f209,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f212,plain,
~ axiom_m4,
inference(cnf_transformation,[],[f104]) ).
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f158]) ).
cnf(c_53,plain,
( ~ implies_2
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(cnf_transformation,[],[f162]) ).
cnf(c_57,plain,
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_70,plain,
modus_ponens,
inference(cnf_transformation,[],[f179]) ).
cnf(c_73,plain,
implies_2,
inference(cnf_transformation,[],[f182]) ).
cnf(c_77,plain,
and_3,
inference(cnf_transformation,[],[f186]) ).
cnf(c_85,plain,
( ~ is_a_theorem(X0)
| ~ necessitation
| is_a_theorem(necessarily(X0)) ),
inference(cnf_transformation,[],[f194]) ).
cnf(c_89,plain,
( ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0)))
| axiom_m4 ),
inference(cnf_transformation,[],[f198]) ).
cnf(c_91,plain,
( ~ op_strict_implies
| necessarily(implies(X0,X1)) = strict_implies(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
cnf(c_94,plain,
necessitation,
inference(cnf_transformation,[],[f203]) ).
cnf(c_100,plain,
op_strict_implies,
inference(cnf_transformation,[],[f209]) ).
cnf(c_103,negated_conjecture,
~ axiom_m4,
inference(cnf_transformation,[],[f212]) ).
cnf(c_131,plain,
~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))),
inference(global_subsumption_just,[status(thm)],[c_89,c_103,c_89]) ).
cnf(c_133,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_85,c_94,c_85]) ).
cnf(c_160,plain,
is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(global_subsumption_just,[status(thm)],[c_57,c_77,c_57]) ).
cnf(c_163,plain,
necessarily(implies(X0,X1)) = strict_implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_91,c_100,c_91]) ).
cnf(c_172,plain,
is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(global_subsumption_just,[status(thm)],[c_53,c_73,c_53]) ).
cnf(c_178,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_70,c_49]) ).
cnf(c_179,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_178]) ).
cnf(c_656,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_163,c_133]) ).
cnf(c_935,plain,
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_172,c_179]) ).
cnf(c_2348,plain,
is_a_theorem(implies(X0,and(X0,X0))),
inference(superposition,[status(thm)],[c_160,c_935]) ).
cnf(c_2388,plain,
is_a_theorem(strict_implies(X0,and(X0,X0))),
inference(superposition,[status(thm)],[c_2348,c_656]) ).
cnf(c_2391,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_131,c_2388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL531+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.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 : Fri Aug 25 00:58:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.97/1.17 % SZS status Started for theBenchmark.p
% 2.97/1.17 % SZS status Theorem for theBenchmark.p
% 2.97/1.17
% 2.97/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.97/1.17
% 2.97/1.17 ------ iProver source info
% 2.97/1.17
% 2.97/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.97/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.97/1.17 git: non_committed_changes: false
% 2.97/1.17 git: last_make_outside_of_git: false
% 2.97/1.17
% 2.97/1.17 ------ Parsing...
% 2.97/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.97/1.17
% 2.97/1.17 ------ Preprocessing... sup_sim: 3 sf_s rm: 27 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.97/1.17
% 2.97/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.97/1.17
% 2.97/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.97/1.17 ------ Proving...
% 2.97/1.17 ------ Problem Properties
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17 clauses 26
% 2.97/1.17 conjectures 0
% 2.97/1.17 EPR 0
% 2.97/1.17 Horn 26
% 2.97/1.17 unary 23
% 2.97/1.17 binary 2
% 2.97/1.17 lits 30
% 2.97/1.17 lits eq 7
% 2.97/1.17 fd_pure 0
% 2.97/1.17 fd_pseudo 0
% 2.97/1.17 fd_cond 0
% 2.97/1.17 fd_pseudo_cond 1
% 2.97/1.17 AC symbols 0
% 2.97/1.17
% 2.97/1.17 ------ Schedule dynamic 5 is on
% 2.97/1.17
% 2.97/1.17 ------ no conjectures: strip conj schedule
% 2.97/1.17
% 2.97/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17 ------
% 2.97/1.17 Current options:
% 2.97/1.17 ------
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17 ------ Proving...
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17 % SZS status Theorem for theBenchmark.p
% 2.97/1.17
% 2.97/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.97/1.17
% 2.97/1.17
%------------------------------------------------------------------------------