TSTP Solution File: SYN359+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN359+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:17 EDT 2024
% Result : Theorem 1.58s 1.13s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 3 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 85 ( 31 ~; 22 |; 21 &)
% ( 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 : 62 ( 3 sgn 35 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X1] :
( big_r(X1)
=> ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0) )
=> ? [X0,X1] :
( big_r(X1)
& big_q(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2110) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X1] :
( big_r(X1)
=> ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0) )
=> ? [X0,X1] :
( big_r(X1)
& big_q(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X2] :
( big_r(X2)
=> ? [X3] : big_q(X2,X3) )
& ? [X4] : big_r(X4) )
=> ? [X5,X6] :
( big_r(X6)
& big_q(X5,X6) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X5,X6] :
( ~ big_r(X6)
| ~ big_q(X5,X6) )
& ! [X0,X1] :
( big_q(X0,X0)
| ~ big_q(X0,X1) )
& ! [X2] :
( ? [X3] : big_q(X2,X3)
| ~ big_r(X2) )
& ? [X4] : big_r(X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X5,X6] :
( ~ big_r(X6)
| ~ big_q(X5,X6) )
& ! [X0,X1] :
( big_q(X0,X0)
| ~ big_q(X0,X1) )
& ! [X2] :
( ? [X3] : big_q(X2,X3)
| ~ big_r(X2) )
& ? [X4] : big_r(X4) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) )
& ! [X2,X3] :
( big_q(X2,X2)
| ~ big_q(X2,X3) )
& ! [X4] :
( ? [X5] : big_q(X4,X5)
| ~ big_r(X4) )
& ? [X6] : big_r(X6) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X4] :
( ? [X5] : big_q(X4,X5)
=> big_q(X4,sK0(X4)) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X6] : big_r(X6)
=> big_r(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) )
& ! [X2,X3] :
( big_q(X2,X2)
| ~ big_q(X2,X3) )
& ! [X4] :
( big_q(X4,sK0(X4))
| ~ big_r(X4) )
& big_r(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
big_r(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X4] :
( big_q(X4,sK0(X4))
| ~ big_r(X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X3] :
( big_q(X2,X2)
| ~ big_q(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ big_q(X0,X1)
| ~ big_r(X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ big_q(X0,X1)
| big_q(X0,X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
( ~ big_r(X0)
| big_q(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,negated_conjecture,
big_r(sK1),
inference(cnf_transformation,[],[f10]) ).
cnf(c_53,plain,
( ~ big_r(sK1)
| big_q(sK1,sK0(sK1)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_54,plain,
( ~ big_q(sK1,sK1)
| ~ big_r(sK1) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_88,negated_conjecture,
( ~ big_q(X0,X1)
| big_q(X0,X0) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_89,plain,
( ~ big_q(sK1,sK0(sK1))
| big_q(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_90,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_89,c_54,c_53,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN359+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n014.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:37:32 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/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.58/1.13 % SZS status Started for theBenchmark.p
% 1.58/1.13 % SZS status Theorem for theBenchmark.p
% 1.58/1.13
% 1.58/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.58/1.13
% 1.58/1.13 ------ iProver source info
% 1.58/1.13
% 1.58/1.13 git: date: 2024-05-02 19:28:25 +0000
% 1.58/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.58/1.13 git: non_committed_changes: false
% 1.58/1.13
% 1.58/1.13 ------ Parsing...
% 1.58/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.58/1.13
% 1.58/1.13 ------ 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.58/1.13
% 1.58/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.58/1.13 ------ Proving...
% 1.58/1.13 ------ Problem Properties
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13 clauses 3
% 1.58/1.13 conjectures 1
% 1.58/1.13 EPR 2
% 1.58/1.13 Horn 3
% 1.58/1.13 unary 2
% 1.58/1.13 binary 1
% 1.58/1.13 lits 4
% 1.58/1.13 lits eq 0
% 1.58/1.13 fd_pure 0
% 1.58/1.13 fd_pseudo 0
% 1.58/1.13 fd_cond 0
% 1.58/1.13 fd_pseudo_cond 0
% 1.58/1.13 AC symbols 0
% 1.58/1.13
% 1.58/1.13 ------ Schedule dynamic 5 is on
% 1.58/1.13
% 1.58/1.13 ------ no equalities: superposition off
% 1.58/1.13
% 1.58/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13 ------
% 1.58/1.13 Current options:
% 1.58/1.13 ------
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13 ------ Proving...
% 1.58/1.13
% 1.58/1.13
% 1.58/1.13 % SZS status Theorem for theBenchmark.p
% 1.58/1.13
% 1.58/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.13
% 1.58/1.13
%------------------------------------------------------------------------------