TSTP Solution File: SYN373+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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.49s 1.20s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 111 ( 46 ~; 40 |; 12 &)
% ( 3 <=>; 9 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 52 ( 10 sgn 21 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X0] : big_p(X0)
=> ? [X0] : big_q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2124) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X0] : big_p(X0)
=> ? [X0] : big_q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
( big_p(X0)
=> big_q(X0) )
<=> ( ! [X1] : big_p(X1)
=> ? [X2] : big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( big_q(X0)
| ~ big_p(X0) )
<~> ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ( ! [X2] : ~ big_q(X2)
& ! [X1] : big_p(X1) )
| ! [X0] :
( ~ big_q(X0)
& big_p(X0) ) )
& ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1)
| ? [X0] :
( big_q(X0)
| ~ big_p(X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ( ! [X2] : ~ big_q(X2)
& ! [X1] : big_p(X1) )
| ! [X0] :
( ~ big_q(X0)
& big_p(X0) ) )
& ( ? [X2] : big_q(X2)
| ? [X1] : ~ big_p(X1)
| ? [X0] :
( big_q(X0)
| ~ big_p(X0) ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ( ! [X0] : ~ big_q(X0)
& ! [X1] : big_p(X1) )
| ! [X2] :
( ~ big_q(X2)
& big_p(X2) ) )
& ( ? [X3] : big_q(X3)
| ? [X4] : ~ big_p(X4)
| ? [X5] :
( big_q(X5)
| ~ big_p(X5) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ? [X3] : big_q(X3)
=> big_q(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] : ~ big_p(X4)
=> ~ big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X5] :
( big_q(X5)
| ~ big_p(X5) )
=> ( big_q(sK2)
| ~ big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ( ( ! [X0] : ~ big_q(X0)
& ! [X1] : big_p(X1) )
| ! [X2] :
( ~ big_q(X2)
& big_p(X2) ) )
& ( big_q(sK0)
| ~ big_p(sK1)
| big_q(sK2)
| ~ big_p(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f12,plain,
( big_q(sK0)
| ~ big_p(sK1)
| big_q(sK2)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f13,plain,
! [X2,X1] :
( big_p(X1)
| big_p(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f14,plain,
! [X2,X1] :
( big_p(X1)
| ~ big_q(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
! [X2,X0] :
( ~ big_q(X0)
| ~ big_q(X2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,negated_conjecture,
( ~ big_q(X0)
| ~ big_q(X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_51,negated_conjecture,
( ~ big_q(X0)
| big_p(X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_52,negated_conjecture,
( big_p(X0)
| big_p(X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
( ~ big_p(sK1)
| ~ big_p(sK2)
| big_q(sK0)
| big_q(sK2) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_54,plain,
big_p(sK2),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
~ big_q(sK2),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_56,plain,
( big_q(sK0)
| ~ big_p(sK1) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_54,c_55,c_53]) ).
cnf(c_57,negated_conjecture,
( ~ big_p(sK1)
| big_q(sK0) ),
inference(renaming,[status(thm)],[c_56]) ).
cnf(c_90,negated_conjecture,
( big_p(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_52]) ).
cnf(c_91,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_52]) ).
cnf(c_92,negated_conjecture,
( ~ big_q(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_51]) ).
cnf(c_94,negated_conjecture,
sP1_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_96,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_91]) ).
cnf(c_101,negated_conjecture,
( ~ sP0_iProver_def
| big_p(X0) ),
inference(demodulation,[status(thm)],[c_90]) ).
cnf(c_102,negated_conjecture,
sP1_iProver_def,
inference(demodulation,[status(thm)],[c_94]) ).
cnf(c_104,negated_conjecture,
( ~ big_q(X0)
| ~ sP1_iProver_def ),
inference(demodulation,[status(thm)],[c_92]) ).
cnf(c_105,plain,
( ~ sP0_iProver_def
| big_p(sK1) ),
inference(instantiation,[status(thm)],[c_101]) ).
cnf(c_106,plain,
( ~ big_q(sK0)
| ~ sP1_iProver_def ),
inference(instantiation,[status(thm)],[c_104]) ).
cnf(c_107,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_106,c_105,c_102,c_96,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 21:21:52 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.49/1.20 % SZS status Started for theBenchmark.p
% 1.49/1.20 % SZS status Theorem for theBenchmark.p
% 1.49/1.20
% 1.49/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.49/1.20
% 1.49/1.20 ------ iProver source info
% 1.49/1.20
% 1.49/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.49/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.49/1.20 git: non_committed_changes: false
% 1.49/1.20
% 1.49/1.20 ------ Parsing...
% 1.49/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.49/1.20
% 1.49/1.20 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.49/1.20 gs_s sp: 6 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.49/1.20 ------ Proving...
% 1.49/1.20 ------ Problem Properties
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20 clauses 6
% 1.49/1.20 conjectures 6
% 1.49/1.20 EPR 6
% 1.49/1.20 Horn 5
% 1.49/1.20 unary 2
% 1.49/1.20 binary 4
% 1.49/1.20 lits 10
% 1.49/1.20 lits eq 0
% 1.49/1.20 fd_pure 0
% 1.49/1.20 fd_pseudo 0
% 1.49/1.20 fd_cond 0
% 1.49/1.20 fd_pseudo_cond 0
% 1.49/1.20 AC symbols 0
% 1.49/1.20
% 1.49/1.20 ------ Schedule EPR non Horn non eq is on
% 1.49/1.20
% 1.49/1.20 ------ no equalities: superposition off
% 1.49/1.20
% 1.49/1.20 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20 ------
% 1.49/1.20 Current options:
% 1.49/1.20 ------
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20 ------ Proving...
% 1.49/1.20
% 1.49/1.20
% 1.49/1.20 % SZS status Theorem for theBenchmark.p
% 1.49/1.20
% 1.49/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.49/1.20
% 1.49/1.20
%------------------------------------------------------------------------------