TSTP Solution File: SYN051+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN051+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 Sep 1 03:04:54 EDT 2023
% Result : Theorem 0.52s 1.19s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 22 ~; 19 |; 1 &)
% ( 2 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 15 ( 3 sgn; 4 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( p
=> big_f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_1) ).
fof(f2,axiom,
? [X0] :
( big_f(X0)
=> p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_2) ).
fof(f3,conjecture,
? [X0] :
( p
<=> big_f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( p
<=> big_f(X0) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
? [X0] :
( big_f(X0)
| ~ p ),
inference(ennf_transformation,[],[f1]) ).
fof(f6,plain,
? [X0] :
( p
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0] :
( p
<~> big_f(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
( ? [X0] :
( big_f(X0)
| ~ p )
=> ( big_f(sK0)
| ~ p ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( big_f(sK0)
| ~ p ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f8]) ).
fof(f10,plain,
( ? [X0] :
( p
| ~ big_f(X0) )
=> ( p
| ~ big_f(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( p
| ~ big_f(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f6,f10]) ).
fof(f12,plain,
! [X0] :
( ( ~ big_f(X0)
| ~ p )
& ( big_f(X0)
| p ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f13,plain,
( big_f(sK0)
| ~ p ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
( p
| ~ big_f(sK1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0] :
( big_f(X0)
| p ),
inference(cnf_transformation,[],[f12]) ).
fof(f16,plain,
! [X0] :
( ~ big_f(X0)
| ~ p ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
( ~ p
| big_f(sK0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,plain,
( ~ big_f(sK1)
| p ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( ~ big_f(X0)
| ~ p ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,negated_conjecture,
( big_f(X0)
| p ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_54,plain,
( ~ big_f(sK0)
| ~ p ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_55,negated_conjecture,
big_f(X0),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_49,c_54]) ).
cnf(c_58,plain,
~ big_f(sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_51,c_55]) ).
cnf(c_66,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN051+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 20:31:09 EDT 2023
% 0.13/0.35 % 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.52/1.19 % SZS status Started for theBenchmark.p
% 0.52/1.19 % SZS status Theorem for theBenchmark.p
% 0.52/1.19
% 0.52/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.52/1.19
% 0.52/1.19 ------ iProver source info
% 0.52/1.19
% 0.52/1.19 git: date: 2023-05-31 18:12:56 +0000
% 0.52/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.52/1.19 git: non_committed_changes: false
% 0.52/1.19 git: last_make_outside_of_git: false
% 0.52/1.19
% 0.52/1.19 ------ Parsing...
% 0.52/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.52/1.19
% 0.52/1.19
% 0.52/1.19 ------ Preprocessing...
% 0.52/1.19
% 0.52/1.19 % SZS status Theorem for theBenchmark.p
% 0.52/1.19
% 0.52/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.52/1.20
% 0.52/1.20
%------------------------------------------------------------------------------