TSTP Solution File: SYN078+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:11 EDT 2023
% Result : Theorem 1.67s 1.19s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 115 ( 20 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 126 ( 48 ~; 46 |; 22 &)
% ( 2 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn; 21 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel56) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) )
<~> ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ? [X2] :
( ~ big_p(f(X2))
& big_p(X2) )
| ? [X0] :
( ~ big_p(X0)
& ? [X1] :
( f(X1) = X0
& big_p(X1) ) ) )
& ( ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) )
| ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
| ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
=> ( ~ big_p(f(sK0))
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) )
=> ( ~ big_p(sK1)
& ? [X2] :
( f(X2) = sK1
& big_p(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] :
( f(X2) = sK1
& big_p(X2) )
=> ( sK1 = f(sK2)
& big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( ( ~ big_p(f(sK0))
& big_p(sK0) )
| ( ~ big_p(sK1)
& sK1 = f(sK2)
& big_p(sK2) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f8,f7,f6]) ).
fof(f10,plain,
! [X3,X4,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(X4)
| f(X5) != X4
| ~ big_p(X5) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
( big_p(sK0)
| big_p(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
( big_p(sK0)
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
( big_p(sK0)
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
( ~ big_p(f(sK0))
| big_p(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
( ~ big_p(f(sK0))
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
( ~ big_p(f(sK0))
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X3,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(f(X5))
| ~ big_p(X5) ),
inference(equality_resolution,[],[f10]) ).
cnf(c_49,negated_conjecture,
( ~ big_p(f(sK0))
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,negated_conjecture,
( ~ big_p(f(sK0))
| f(sK2) = sK1 ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_51,negated_conjecture,
( ~ big_p(f(sK0))
| big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_52,negated_conjecture,
( ~ big_p(sK1)
| big_p(sK0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
( f(sK2) = sK1
| big_p(sK0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_54,negated_conjecture,
( big_p(sK0)
| big_p(sK2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_55,negated_conjecture,
( ~ big_p(X0)
| ~ big_p(X1)
| big_p(f(X0))
| big_p(f(X1)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_56,plain,
( ~ big_p(sK0)
| big_p(f(sK0)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_57,negated_conjecture,
big_p(sK2),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_51,c_56]) ).
cnf(c_59,negated_conjecture,
~ big_p(sK1),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_49,c_56]) ).
cnf(c_61,negated_conjecture,
big_p(sK2),
inference(global_subsumption_just,[status(thm)],[c_51,c_57]) ).
cnf(c_63,negated_conjecture,
f(sK2) = sK1,
inference(global_subsumption_just,[status(thm)],[c_53,c_53,c_50,c_56]) ).
cnf(c_65,negated_conjecture,
~ big_p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_59]) ).
cnf(c_67,negated_conjecture,
f(sK2) = sK1,
inference(global_subsumption_just,[status(thm)],[c_50,c_63]) ).
cnf(c_115,negated_conjecture,
( ~ big_p(X0)
| big_p(f(X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_55]) ).
cnf(c_116,negated_conjecture,
sP0_iProver_split,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_55]) ).
cnf(c_187,plain,
( big_p(f(X0))
| ~ big_p(X0) ),
inference(global_subsumption_just,[status(thm)],[c_115,c_115,c_116]) ).
cnf(c_188,negated_conjecture,
( ~ big_p(X0)
| big_p(f(X0)) ),
inference(renaming,[status(thm)],[c_187]) ).
cnf(c_191,plain,
( ~ big_p(sK2)
| big_p(sK1) ),
inference(superposition,[status(thm)],[c_67,c_188]) ).
cnf(c_192,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_191,c_65,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 17:13:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.67/1.19 % SZS status Started for theBenchmark.p
% 1.67/1.19 % SZS status Theorem for theBenchmark.p
% 1.67/1.19
% 1.67/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.67/1.19
% 1.67/1.19 ------ iProver source info
% 1.67/1.19
% 1.67/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.67/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.67/1.19 git: non_committed_changes: false
% 1.67/1.19 git: last_make_outside_of_git: false
% 1.67/1.19
% 1.67/1.19 ------ Parsing...
% 1.67/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.67/1.19
% 1.67/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.67/1.19
% 1.67/1.19 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.67/1.19
% 1.67/1.19 ------ Preprocessing... sf_s rm: 2 0s sf_e sf_s rm: 0 0s sf_e
% 1.67/1.19 ------ Proving...
% 1.67/1.19 ------ Problem Properties
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19 clauses 5
% 1.67/1.19 conjectures 5
% 1.67/1.19 EPR 3
% 1.67/1.19 Horn 5
% 1.67/1.19 unary 4
% 1.67/1.19 binary 0
% 1.67/1.19 lits 7
% 1.67/1.19 lits eq 1
% 1.67/1.19 fd_pure 0
% 1.67/1.19 fd_pseudo 0
% 1.67/1.19 fd_cond 0
% 1.67/1.19 fd_pseudo_cond 0
% 1.67/1.19 AC symbols 0
% 1.67/1.19
% 1.67/1.19 ------ Schedule dynamic 5 is on
% 1.67/1.19
% 1.67/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19 ------
% 1.67/1.19 Current options:
% 1.67/1.19 ------
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19 ------ Proving...
% 1.67/1.19
% 1.67/1.19
% 1.67/1.19 % SZS status Theorem for theBenchmark.p
% 1.67/1.19
% 1.67/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.19
% 1.67/1.19
%------------------------------------------------------------------------------