TSTP Solution File: LCL455+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL455+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:35 EDT 2023
% Result : Theorem 0.68s 1.17s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 14 ~; 7 |; 0 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn; 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
( or_2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_2) ).
fof(f23,axiom,
( r2
<=> ! [X3,X4] : is_a_theorem(implies(X4,or(X3,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f44,axiom,
or_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(f53,conjecture,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f54,negated_conjecture,
~ r2,
inference(negated_conjecture,[],[f53]) ).
fof(f62,plain,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(rectify,[],[f23]) ).
fof(f66,plain,
~ r2,
inference(flattening,[],[f54]) ).
fof(f67,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
=> r2 ),
inference(unused_predicate_definition_removal,[],[f62]) ).
fof(f72,plain,
( or_2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f94,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ or_2 ),
inference(ennf_transformation,[],[f72]) ).
fof(f99,plain,
( r2
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f105,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1)))
=> ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f99,f105]) ).
fof(f117,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ or_2 ),
inference(cnf_transformation,[],[f94]) ).
fof(f122,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f106]) ).
fof(f140,plain,
or_2,
inference(cnf_transformation,[],[f44]) ).
fof(f149,plain,
~ r2,
inference(cnf_transformation,[],[f66]) ).
cnf(c_59,plain,
( ~ or_2
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(cnf_transformation,[],[f117]) ).
cnf(c_64,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| r2 ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_82,plain,
or_2,
inference(cnf_transformation,[],[f140]) ).
cnf(c_91,negated_conjecture,
~ r2,
inference(cnf_transformation,[],[f149]) ).
cnf(c_111,plain,
~ is_a_theorem(implies(sK1,or(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_64,c_91,c_64]) ).
cnf(c_113,plain,
is_a_theorem(implies(X0,or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_59,c_82,c_59]) ).
cnf(c_213,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_111,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL455+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.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 : Thu Aug 24 18:45:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.68/1.17 % SZS status Started for theBenchmark.p
% 0.68/1.17 % SZS status Theorem for theBenchmark.p
% 0.68/1.17
% 0.68/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.68/1.17
% 0.68/1.17 ------ iProver source info
% 0.68/1.17
% 0.68/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.68/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.68/1.17 git: non_committed_changes: false
% 0.68/1.17 git: last_make_outside_of_git: false
% 0.68/1.17
% 0.68/1.17 ------ Parsing...
% 0.68/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.68/1.17
% 0.68/1.17 ------ Preprocessing...
% 0.68/1.17
% 0.68/1.17 % SZS status Theorem for theBenchmark.p
% 0.68/1.17
% 0.68/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.68/1.17
% 0.68/1.17
%------------------------------------------------------------------------------