TSTP Solution File: LCL512+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:50 EDT 2023
% Result : Theorem 1.24s 1.16s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 50 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 10 |; 0 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn; 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_1) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f43,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(f44,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[],[f43]) ).
fof(f46,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f56,plain,
~ equivalence_1,
inference(flattening,[],[f44]) ).
fof(f58,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f68,plain,
( equivalence_1
| ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
inference(ennf_transformation,[],[f60]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f58]) ).
fof(f74,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f79,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f76]) ).
fof(f81,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f85,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f74]) ).
fof(f91,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f96,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f97,plain,
~ equivalence_1,
inference(cnf_transformation,[],[f56]) ).
cnf(c_51,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| equivalence_1 ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_53,plain,
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_57,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_63,plain,
kn2,
inference(cnf_transformation,[],[f91]) ).
cnf(c_68,plain,
op_equiv,
inference(cnf_transformation,[],[f96]) ).
cnf(c_69,negated_conjecture,
~ equivalence_1,
inference(cnf_transformation,[],[f97]) ).
cnf(c_77,plain,
is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_53,c_63,c_53]) ).
cnf(c_83,plain,
~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_51,c_69,c_51]) ).
cnf(c_96,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_57,c_68,c_57]) ).
cnf(c_389,plain,
is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))),
inference(superposition,[status(thm)],[c_96,c_77]) ).
cnf(c_390,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_83,c_389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 05:46:58 EDT 2023
% 0.12/0.34 % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.24/1.16 % SZS status Started for theBenchmark.p
% 1.24/1.16 % SZS status Theorem for theBenchmark.p
% 1.24/1.16
% 1.24/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.24/1.16
% 1.24/1.16 ------ iProver source info
% 1.24/1.16
% 1.24/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.24/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.24/1.16 git: non_committed_changes: false
% 1.24/1.16 git: last_make_outside_of_git: false
% 1.24/1.16
% 1.24/1.16 ------ Parsing...
% 1.24/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.24/1.16
% 1.24/1.16 ------ Preprocessing... sup_sim: 2 sf_s rm: 10 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.24/1.16
% 1.24/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.24/1.16
% 1.24/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.24/1.16 ------ Proving...
% 1.24/1.16 ------ Problem Properties
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16 clauses 9
% 1.24/1.16 conjectures 0
% 1.24/1.16 EPR 0
% 1.24/1.16 Horn 9
% 1.24/1.16 unary 7
% 1.24/1.16 binary 1
% 1.24/1.16 lits 12
% 1.24/1.16 lits eq 4
% 1.24/1.16 fd_pure 0
% 1.24/1.16 fd_pseudo 0
% 1.24/1.16 fd_cond 0
% 1.24/1.16 fd_pseudo_cond 1
% 1.24/1.16 AC symbols 0
% 1.24/1.16
% 1.24/1.16 ------ Schedule dynamic 5 is on
% 1.24/1.16
% 1.24/1.16 ------ no conjectures: strip conj schedule
% 1.24/1.16
% 1.24/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16 ------
% 1.24/1.16 Current options:
% 1.24/1.16 ------
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16 ------ Proving...
% 1.24/1.16
% 1.24/1.16
% 1.24/1.16 % SZS status Theorem for theBenchmark.p
% 1.24/1.16
% 1.24/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.24/1.16
% 1.24/1.16
%------------------------------------------------------------------------------