TSTP Solution File: LCL452+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:34 EDT 2023
% Result : Theorem 2.15s 1.17s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 21 unt; 0 def)
% Number of atoms : 63 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 42 ( 21 ~; 13 |; 0 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 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 : 44 ( 2 sgn; 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_1) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f53,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f54,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f53]) ).
fof(f59,plain,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(rectify,[],[f20]) ).
fof(f66,plain,
~ cn2,
inference(flattening,[],[f54]) ).
fof(f67,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f59]) ).
fof(f73,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f96,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f73]) ).
fof(f102,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f103,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f104,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f106,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
=> ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f102,f106]) ).
fof(f117,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f123,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f107]) ).
fof(f124,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f103]) ).
fof(f125,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f104]) ).
fof(f128,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f138,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f145,plain,
op_or,
inference(cnf_transformation,[],[f50]) ).
fof(f147,plain,
~ cn2,
inference(cnf_transformation,[],[f66]) ).
cnf(c_58,plain,
( ~ or_1
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(cnf_transformation,[],[f117]) ).
cnf(c_64,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_65,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_66,plain,
( ~ op_implies_and
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_69,plain,
op_implies_and,
inference(cnf_transformation,[],[f128]) ).
cnf(c_79,plain,
or_1,
inference(cnf_transformation,[],[f138]) ).
cnf(c_86,plain,
op_or,
inference(cnf_transformation,[],[f145]) ).
cnf(c_88,negated_conjecture,
~ cn2,
inference(cnf_transformation,[],[f147]) ).
cnf(c_109,plain,
is_a_theorem(implies(X0,or(X0,X1))),
inference(global_subsumption_just,[status(thm)],[c_58,c_79,c_58]) ).
cnf(c_119,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(global_subsumption_just,[status(thm)],[c_64,c_88,c_64]) ).
cnf(c_132,plain,
not(and(X0,not(X1))) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_66,c_69,c_66]) ).
cnf(c_143,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_65,c_86,c_65]) ).
cnf(c_248,plain,
implies(not(X0),X1) = or(X0,X1),
inference(demodulation,[status(thm)],[c_143,c_132]) ).
cnf(c_250,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(demodulation,[status(thm)],[c_119,c_248]) ).
cnf(c_251,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_250,c_109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.18/0.35 % Computer : n026.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Fri Aug 25 07:35:47 EDT 2023
% 0.18/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.15/1.17 % SZS status Started for theBenchmark.p
% 2.15/1.17 % SZS status Theorem for theBenchmark.p
% 2.15/1.17
% 2.15/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.15/1.17
% 2.15/1.17 ------ iProver source info
% 2.15/1.17
% 2.15/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.15/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.15/1.17 git: non_committed_changes: false
% 2.15/1.17 git: last_make_outside_of_git: false
% 2.15/1.17
% 2.15/1.17 ------ Parsing...
% 2.15/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.15/1.17
% 2.15/1.17 ------ Preprocessing...
% 2.15/1.17
% 2.15/1.17 % SZS status Theorem for theBenchmark.p
% 2.15/1.17
% 2.15/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.15/1.17
% 2.15/1.17
%------------------------------------------------------------------------------