TSTP Solution File: LCL527+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL527+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:54 EDT 2023
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 14 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 38 ~; 36 |; 14 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn; 22 !; 6 ?)
% 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(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(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f52,axiom,
( adjunction
<=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',adjunction) ).
fof(f88,conjecture,
adjunction,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f89,negated_conjecture,
~ adjunction,
inference(negated_conjecture,[],[f88]) ).
fof(f104,plain,
~ adjunction,
inference(flattening,[],[f89]) ).
fof(f108,plain,
( ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) )
=> adjunction ),
inference(unused_predicate_definition_removal,[],[f52]) ).
fof(f116,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
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(f138,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f116]) ).
fof(f149,plain,
( adjunction
| ? [X0,X1] :
( ~ is_a_theorem(and(X0,X1))
& is_a_theorem(X1)
& is_a_theorem(X0) ) ),
inference(ennf_transformation,[],[f108]) ).
fof(f150,plain,
( adjunction
| ? [X0,X1] :
( ~ is_a_theorem(and(X0,X1))
& is_a_theorem(X1)
& is_a_theorem(X0) ) ),
inference(flattening,[],[f149]) ).
fof(f157,plain,
( ? [X0,X1] :
( ~ is_a_theorem(and(X0,X1))
& is_a_theorem(X1)
& is_a_theorem(X0) )
=> ( ~ is_a_theorem(and(sK0,sK1))
& is_a_theorem(sK1)
& is_a_theorem(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( adjunction
| ( ~ is_a_theorem(and(sK0,sK1))
& is_a_theorem(sK1)
& is_a_theorem(sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f150,f157]) ).
fof(f159,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f130]) ).
fof(f167,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f138]) ).
fof(f180,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f187,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f196,plain,
( adjunction
| is_a_theorem(sK0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f197,plain,
( adjunction
| is_a_theorem(sK1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f198,plain,
( adjunction
| ~ is_a_theorem(and(sK0,sK1)) ),
inference(cnf_transformation,[],[f158]) ).
fof(f215,plain,
~ adjunction,
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,[],[f159]) ).
cnf(c_57,plain,
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_70,plain,
modus_ponens,
inference(cnf_transformation,[],[f180]) ).
cnf(c_77,plain,
and_3,
inference(cnf_transformation,[],[f187]) ).
cnf(c_86,plain,
( ~ is_a_theorem(and(sK0,sK1))
| adjunction ),
inference(cnf_transformation,[],[f198]) ).
cnf(c_87,plain,
( is_a_theorem(sK1)
| adjunction ),
inference(cnf_transformation,[],[f197]) ).
cnf(c_88,plain,
( is_a_theorem(sK0)
| adjunction ),
inference(cnf_transformation,[],[f196]) ).
cnf(c_105,negated_conjecture,
~ adjunction,
inference(cnf_transformation,[],[f215]) ).
cnf(c_166,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_184,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_185,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_184]) ).
cnf(c_753,plain,
( ~ is_a_theorem(implies(X0,and(sK0,sK1)))
| ~ is_a_theorem(X0)
| is_a_theorem(and(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_185]) ).
cnf(c_759,plain,
( ~ is_a_theorem(implies(X0,implies(X1,and(sK0,sK1))))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,and(sK0,sK1))) ),
inference(instantiation,[status(thm)],[c_185]) ).
cnf(c_938,plain,
( ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1))))
| ~ is_a_theorem(sK0)
| is_a_theorem(implies(sK1,and(sK0,sK1))) ),
inference(instantiation,[status(thm)],[c_759]) ).
cnf(c_939,plain,
is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_1217,plain,
( ~ is_a_theorem(implies(sK1,and(sK0,sK1)))
| ~ is_a_theorem(sK1)
| is_a_theorem(and(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_753]) ).
cnf(c_1218,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1217,c_939,c_938,c_86,c_87,c_88,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL527+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 23:20:06 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15 git: last_make_outside_of_git: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ 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
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 28
% 0.46/1.15 conjectures 0
% 0.46/1.15 EPR 2
% 0.46/1.15 Horn 28
% 0.46/1.15 unary 25
% 0.46/1.15 binary 2
% 0.46/1.15 lits 32
% 0.46/1.15 lits eq 7
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 0
% 0.46/1.15 fd_pseudo_cond 1
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule dynamic 5 is on
% 0.46/1.15
% 0.46/1.15 ------ no conjectures: strip conj schedule
% 0.46/1.15
% 0.46/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------