TSTP Solution File: SYN064+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN064+1 : TPTP v8.1.2. Released v2.0.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 : Fri Sep 1 03:05:02 EDT 2023
% Result : Theorem 0.71s 1.17s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 7 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 0 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 4 sgn; 10 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
( big_p(X0,X1)
=> ! [X2,X3] : big_p(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel35) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
( big_p(X0,X1)
=> ! [X2,X3] : big_p(X2,X3) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0,X1] :
( ? [X2,X3] : ~ big_p(X2,X3)
& big_p(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X2,X3] : ~ big_p(X2,X3)
=> ~ big_p(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X0,X1] :
( ~ big_p(sK0,sK1)
& big_p(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f3,f4]) ).
fof(f6,plain,
! [X0,X1] : big_p(X0,X1),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
~ big_p(sK0,sK1),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
~ big_p(sK0,sK1),
inference(cnf_transformation,[],[f7]) ).
cnf(c_50,negated_conjecture,
big_p(X0,X1),
inference(cnf_transformation,[],[f6]) ).
cnf(c_52,negated_conjecture,
big_p(X0_13,X0_14),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_54,plain,
big_p(sK0,sK1),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_54,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN064+1 : TPTP v8.1.2. Released v2.0.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 : Sat Aug 26 20:57:07 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.71/1.17 % SZS status Started for theBenchmark.p
% 0.71/1.17 % SZS status Theorem for theBenchmark.p
% 0.71/1.17
% 0.71/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.71/1.17
% 0.71/1.17 ------ iProver source info
% 0.71/1.17
% 0.71/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.71/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.71/1.17 git: non_committed_changes: false
% 0.71/1.17 git: last_make_outside_of_git: false
% 0.71/1.17
% 0.71/1.17 ------ Parsing...
% 0.71/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.71/1.17
% 0.71/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.71/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.71/1.17 ------ Proving...
% 0.71/1.17 ------ Problem Properties
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17 clauses 2
% 0.71/1.17 conjectures 2
% 0.71/1.17 EPR 2
% 0.71/1.17 Horn 2
% 0.71/1.17 unary 2
% 0.71/1.17 binary 0
% 0.71/1.17 lits 2
% 0.71/1.17 lits eq 0
% 0.71/1.17 fd_pure 0
% 0.71/1.17 fd_pseudo 0
% 0.71/1.17 fd_cond 0
% 0.71/1.17 fd_pseudo_cond 0
% 0.71/1.17 AC symbols 0
% 0.71/1.17
% 0.71/1.17 ------ Schedule EPR Horn non eq is on
% 0.71/1.17
% 0.71/1.17 ------ no equalities: superposition off
% 0.71/1.17
% 0.71/1.17 ------ Option_epr_horn Time Limit: Unbounded
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17 ------
% 0.71/1.17 Current options:
% 0.71/1.17 ------
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17 ------ Proving...
% 0.71/1.17
% 0.71/1.17
% 0.71/1.17 % SZS status Theorem for theBenchmark.p
% 0.71/1.17
% 0.71/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.17
% 0.71/1.17
%------------------------------------------------------------------------------