TSTP Solution File: SYN381+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:23 EDT 2024
% Result : Theorem 1.56s 1.12s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 85 ( 28 ~; 28 |; 18 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 64 ( 2 sgn 41 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X4,X5] :
( big_q(X4,X5)
=> ( big_q(X5,X5)
| big_q(X5,X4) ) )
& ! [X2] :
? [X3] : big_q(X3,X2)
& ! [X0] :
( ? [X1] : big_q(X0,X1)
=> big_p(X0) ) )
=> ! [X5] : big_p(X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2133) ).
fof(f2,negated_conjecture,
~ ( ( ! [X4,X5] :
( big_q(X4,X5)
=> ( big_q(X5,X5)
| big_q(X5,X4) ) )
& ! [X2] :
? [X3] : big_q(X3,X2)
& ! [X0] :
( ? [X1] : big_q(X0,X1)
=> big_p(X0) ) )
=> ! [X5] : big_p(X5) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( big_q(X0,X1)
=> ( big_q(X1,X1)
| big_q(X1,X0) ) )
& ! [X2] :
? [X3] : big_q(X3,X2)
& ! [X4] :
( ? [X5] : big_q(X4,X5)
=> big_p(X4) ) )
=> ! [X6] : big_p(X6) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X6] : ~ big_p(X6)
& ! [X0,X1] :
( big_q(X1,X1)
| big_q(X1,X0)
| ~ big_q(X0,X1) )
& ! [X2] :
? [X3] : big_q(X3,X2)
& ! [X4] :
( big_p(X4)
| ! [X5] : ~ big_q(X4,X5) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X6] : ~ big_p(X6)
& ! [X0,X1] :
( big_q(X1,X1)
| big_q(X1,X0)
| ~ big_q(X0,X1) )
& ! [X2] :
? [X3] : big_q(X3,X2)
& ! [X4] :
( big_p(X4)
| ! [X5] : ~ big_q(X4,X5) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] : ~ big_p(X0)
& ! [X1,X2] :
( big_q(X2,X2)
| big_q(X2,X1)
| ~ big_q(X1,X2) )
& ! [X3] :
? [X4] : big_q(X4,X3)
& ! [X5] :
( big_p(X5)
| ! [X6] : ~ big_q(X5,X6) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] : ~ big_p(X0)
=> ~ big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] : big_q(X4,X3)
=> big_q(sK1(X3),X3) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ~ big_p(sK0)
& ! [X1,X2] :
( big_q(X2,X2)
| big_q(X2,X1)
| ~ big_q(X1,X2) )
& ! [X3] : big_q(sK1(X3),X3)
& ! [X5] :
( big_p(X5)
| ! [X6] : ~ big_q(X5,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
! [X6,X5] :
( big_p(X5)
| ~ big_q(X5,X6) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X3] : big_q(sK1(X3),X3),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X1] :
( big_q(X2,X2)
| big_q(X2,X1)
| ~ big_q(X1,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
~ big_p(sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ big_p(sK0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ big_q(X0,X1)
| big_q(X1,X0)
| big_q(X1,X1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
big_q(sK1(X0),X0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,negated_conjecture,
( ~ big_q(X0,X1)
| big_p(X0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_53,plain,
big_q(sK1(sK0),sK0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_54,plain,
( ~ big_q(sK0,sK0)
| big_p(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_69,plain,
~ big_q(sK0,X0),
inference(resolution,[status(thm)],[c_49,c_52]) ).
cnf(c_86,negated_conjecture,
( ~ big_q(X0,X1)
| big_q(X1,X0)
| big_q(X1,X1) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_87,plain,
( ~ big_q(sK1(X0),X0)
| big_q(X0,sK1(X0))
| big_q(X0,X0) ),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_88,plain,
( ~ big_q(sK1(sK0),sK0)
| big_q(sK0,sK1(sK0))
| big_q(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_91,plain,
~ big_q(sK0,sK1(sK0)),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_92,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_91,c_88,c_54,c_53,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 20:51:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.56/1.12 % SZS status Started for theBenchmark.p
% 1.56/1.12 % SZS status Theorem for theBenchmark.p
% 1.56/1.12
% 1.56/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.56/1.12
% 1.56/1.12 ------ iProver source info
% 1.56/1.12
% 1.56/1.12 git: date: 2024-05-02 19:28:25 +0000
% 1.56/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.56/1.12 git: non_committed_changes: false
% 1.56/1.12
% 1.56/1.12 ------ Parsing...
% 1.56/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.56/1.12
% 1.56/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.56/1.12
% 1.56/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.56/1.12 ------ Proving...
% 1.56/1.12 ------ Problem Properties
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12 clauses 3
% 1.56/1.12 conjectures 2
% 1.56/1.12 EPR 2
% 1.56/1.12 Horn 2
% 1.56/1.12 unary 2
% 1.56/1.12 binary 0
% 1.56/1.12 lits 5
% 1.56/1.12 lits eq 0
% 1.56/1.12 fd_pure 0
% 1.56/1.12 fd_pseudo 0
% 1.56/1.12 fd_cond 0
% 1.56/1.12 fd_pseudo_cond 0
% 1.56/1.12 AC symbols 0
% 1.56/1.12
% 1.56/1.12 ------ Schedule dynamic 5 is on
% 1.56/1.12
% 1.56/1.12 ------ no equalities: superposition off
% 1.56/1.12
% 1.56/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12 ------
% 1.56/1.12 Current options:
% 1.56/1.12 ------
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12 ------ Proving...
% 1.56/1.12
% 1.56/1.12
% 1.56/1.12 % SZS status Theorem for theBenchmark.p
% 1.56/1.12
% 1.56/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.56/1.12
% 1.56/1.12
%------------------------------------------------------------------------------