TSTP Solution File: LCL483+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL483+1 : TPTP v8.1.2. Released v3.3.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:38:00 EDT 2024
% Result : Theorem 2.89s 1.16s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 26 unt; 0 def)
% Number of atoms : 76 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 49 ( 24 ~; 16 |; 0 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_tollens) ).
fof(f24,axiom,
( r3
<=> ! [X3,X4] : is_a_theorem(implies(or(X3,X4),or(X4,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f45,conjecture,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f46,negated_conjecture,
~ modus_tollens,
inference(negated_conjecture,[],[f45]) ).
fof(f55,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(rectify,[],[f24]) ).
fof(f58,plain,
~ modus_tollens,
inference(flattening,[],[f46]) ).
fof(f61,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f64,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
=> modus_tollens ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f70,plain,
( modus_tollens
| ? [X0,X1] : ~ is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f73,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f61]) ).
fof(f76,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f78,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f79,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f81,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
=> ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f70,f81]) ).
fof(f85,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f82]) ).
fof(f88,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f73]) ).
fof(f91,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f76]) ).
fof(f93,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f78]) ).
fof(f94,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f79]) ).
fof(f96,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f102,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f106,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f107,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f109,plain,
~ modus_tollens,
inference(cnf_transformation,[],[f58]) ).
cnf(c_51,plain,
( ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1)))
| modus_tollens ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_54,plain,
( ~ r3
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_57,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_59,plain,
( ~ op_implies_and
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_60,plain,
( ~ op_implies_or
| or(not(X0),X1) = implies(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_62,plain,
op_implies_or,
inference(cnf_transformation,[],[f96]) ).
cnf(c_68,plain,
r3,
inference(cnf_transformation,[],[f102]) ).
cnf(c_72,plain,
op_or,
inference(cnf_transformation,[],[f106]) ).
cnf(c_73,plain,
op_implies_and,
inference(cnf_transformation,[],[f107]) ).
cnf(c_75,negated_conjecture,
~ modus_tollens,
inference(cnf_transformation,[],[f109]) ).
cnf(c_93,plain,
is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_54,c_68,c_54]) ).
cnf(c_96,plain,
or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_60,c_62,c_60]) ).
cnf(c_102,plain,
not(and(X0,not(X1))) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_59,c_73,c_59]) ).
cnf(c_105,plain,
~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_51,c_75,c_51]) ).
cnf(c_112,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_57,c_72,c_57]) ).
cnf(c_190,plain,
implies(not(X0),X1) = or(X0,X1),
inference(demodulation,[status(thm)],[c_112,c_102]) ).
cnf(c_192,plain,
~ is_a_theorem(implies(or(sK1,not(sK0)),implies(sK0,sK1))),
inference(demodulation,[status(thm)],[c_105,c_190]) ).
cnf(c_404,plain,
is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_96,c_93]) ).
cnf(c_518,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_192,c_404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL483+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 18:55:11 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.89/1.16 % SZS status Started for theBenchmark.p
% 2.89/1.16 % SZS status Theorem for theBenchmark.p
% 2.89/1.16
% 2.89/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.89/1.16
% 2.89/1.16 ------ iProver source info
% 2.89/1.16
% 2.89/1.16 git: date: 2024-05-02 19:28:25 +0000
% 2.89/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.89/1.16 git: non_committed_changes: false
% 2.89/1.16
% 2.89/1.16 ------ Parsing...
% 2.89/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.89/1.16
% 2.89/1.16 ------ Preprocessing... sup_sim: 3 sf_s rm: 14 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.89/1.16
% 2.89/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.89/1.16
% 2.89/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.89/1.16 ------ Proving...
% 2.89/1.16 ------ Problem Properties
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16 clauses 13
% 2.89/1.16 conjectures 0
% 2.89/1.16 EPR 0
% 2.89/1.16 Horn 13
% 2.89/1.16 unary 11
% 2.89/1.16 binary 1
% 2.89/1.16 lits 16
% 2.89/1.16 lits eq 6
% 2.89/1.16 fd_pure 0
% 2.89/1.16 fd_pseudo 0
% 2.89/1.16 fd_cond 0
% 2.89/1.16 fd_pseudo_cond 1
% 2.89/1.16 AC symbols 0
% 2.89/1.16
% 2.89/1.16 ------ Schedule dynamic 5 is on
% 2.89/1.16
% 2.89/1.16 ------ no conjectures: strip conj schedule
% 2.89/1.16
% 2.89/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16 ------
% 2.89/1.16 Current options:
% 2.89/1.16 ------
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16 ------ Proving...
% 2.89/1.16
% 2.89/1.16
% 2.89/1.16 % SZS status Theorem for theBenchmark.p
% 2.89/1.16
% 2.89/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.16
% 2.89/1.16
%------------------------------------------------------------------------------