TSTP Solution File: SYN375+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN375+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 May 3 03:30:21 EDT 2024
% Result : Theorem 1.63s 1.19s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 1 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 180 ( 70 ~; 74 |; 17 &)
% ( 11 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 84 ( 14 sgn 39 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2126) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<~> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ( ( ! [X3] : ~ big_p(X3)
| ? [X2] : ~ big_p(X2) )
& ( ? [X3] : big_p(X3)
| ! [X2] : big_p(X2) ) )
| ? [X0] :
( ( ! [X1] : ~ big_p(X1)
| ~ big_p(X0) )
& ( ? [X1] : big_p(X1)
| big_p(X0) ) ) )
& ( ( ( ! [X2] : big_p(X2)
| ! [X3] : ~ big_p(X3) )
& ( ? [X3] : big_p(X3)
| ? [X2] : ~ big_p(X2) ) )
| ! [X0] :
( ( big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ? [X1] : big_p(X1)
| ~ big_p(X0) ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ? [X1] : ~ big_p(X1) )
& ( ? [X2] : big_p(X2)
| ! [X3] : big_p(X3) ) )
| ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( ? [X9] : big_p(X9)
| ? [X10] : ~ big_p(X10) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( ? [X13] : big_p(X13)
| ~ big_p(X11) ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X1] : ~ big_p(X1)
=> ~ big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] : big_p(X2)
=> big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) )
=> ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( ? [X6] : big_p(X6)
| big_p(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] : big_p(X6)
=> big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X9] : big_p(X9)
=> big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X10] : ~ big_p(X10)
=> ~ big_p(sK5) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X13] : big_p(X13)
=> big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ~ big_p(sK0) )
& ( big_p(sK1)
| ! [X3] : big_p(X3) ) )
| ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( big_p(sK3)
| big_p(sK2) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( big_p(sK4)
| ~ big_p(sK5) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( big_p(sK6)
| ~ big_p(X11) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f6,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f18,plain,
! [X11,X8,X7,X12] :
( big_p(X7)
| ~ big_p(X8)
| big_p(X11)
| ~ big_p(X12) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X3] :
( big_p(sK1)
| big_p(X3)
| big_p(sK3)
| big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0] :
( ~ big_p(X0)
| ~ big_p(sK0)
| big_p(sK3)
| big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0,X5] :
( ~ big_p(X0)
| ~ big_p(sK0)
| ~ big_p(X5)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_49,negated_conjecture,
( ~ big_p(X0)
| ~ big_p(X1)
| ~ big_p(sK0)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_50,negated_conjecture,
( ~ big_p(X0)
| ~ big_p(sK0)
| big_p(sK2)
| big_p(sK3) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_52,negated_conjecture,
( big_p(X0)
| big_p(sK2)
| big_p(sK3)
| big_p(sK1) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_53,negated_conjecture,
( ~ big_p(X0)
| ~ big_p(X1)
| big_p(X2)
| big_p(X3) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_59,plain,
( ~ big_p(sK0)
| ~ big_p(sK2) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_62,plain,
( ~ big_p(sK0)
| ~ big_p(X0)
| big_p(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_59]) ).
cnf(c_63,negated_conjecture,
( ~ big_p(X0)
| ~ big_p(sK0)
| big_p(sK3) ),
inference(renaming,[status(thm)],[c_62]) ).
cnf(c_114,negated_conjecture,
( ~ big_p(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_63]) ).
cnf(c_116,negated_conjecture,
( big_p(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_53]) ).
cnf(c_117,negated_conjecture,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
cnf(c_122,negated_conjecture,
( sP0_iProver_def
| sP1_iProver_def ),
inference(demodulation,[status(thm)],[c_117]) ).
cnf(c_125,negated_conjecture,
( ~ big_p(X0)
| ~ sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_114]) ).
cnf(c_126,negated_conjecture,
( ~ sP1_iProver_def
| big_p(X0) ),
inference(demodulation,[status(thm)],[c_116]) ).
cnf(c_127,plain,
( ~ sP1_iProver_def
| big_p(sK2) ),
inference(instantiation,[status(thm)],[c_126]) ).
cnf(c_128,plain,
( ~ big_p(sK2)
| ~ sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_129,plain,
( ~ big_p(sK1)
| ~ sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_130,plain,
( ~ sP1_iProver_def
| big_p(sK0) ),
inference(instantiation,[status(thm)],[c_126]) ).
cnf(c_132,plain,
( ~ big_p(sK3)
| ~ sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_133,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_132,c_130,c_129,c_128,c_125,c_127,c_122,c_59,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN375+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 20:54:13 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.63/1.19 % SZS status Started for theBenchmark.p
% 1.63/1.19 % SZS status Theorem for theBenchmark.p
% 1.63/1.19
% 1.63/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.63/1.19
% 1.63/1.19 ------ iProver source info
% 1.63/1.19
% 1.63/1.19 git: date: 2024-05-02 19:28:25 +0000
% 1.63/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.63/1.19 git: non_committed_changes: false
% 1.63/1.19
% 1.63/1.19 ------ Parsing...
% 1.63/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.63/1.19
% 1.63/1.19 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.63/1.19 gs_s sp: 5 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.63/1.19 ------ Proving...
% 1.63/1.19 ------ Problem Properties
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 clauses 6
% 1.63/1.19 conjectures 6
% 1.63/1.19 EPR 6
% 1.63/1.19 Horn 3
% 1.63/1.19 unary 0
% 1.63/1.19 binary 4
% 1.63/1.19 lits 14
% 1.63/1.19 lits eq 0
% 1.63/1.19 fd_pure 0
% 1.63/1.19 fd_pseudo 0
% 1.63/1.19 fd_cond 0
% 1.63/1.19 fd_pseudo_cond 0
% 1.63/1.19 AC symbols 0
% 1.63/1.19
% 1.63/1.19 ------ Schedule EPR non Horn non eq is on
% 1.63/1.19
% 1.63/1.19 ------ no equalities: superposition off
% 1.63/1.19
% 1.63/1.19 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------
% 1.63/1.19 Current options:
% 1.63/1.19 ------
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------ Proving...
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 % SZS status Theorem for theBenchmark.p
% 1.63/1.19
% 1.63/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.63/1.19
% 1.63/1.19
%------------------------------------------------------------------------------