TSTP Solution File: SYN360+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN360+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:18 EDT 2024
% Result : Theorem 0.71s 1.16s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 42 ( 17 ~; 6 |; 11 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 59 ( 3 sgn 36 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2] :
? [X1] : big_p(X2,X1)
& ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X1] : big_q(X0,X1) ) )
=> ! [X1,X0] : big_q(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2111) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
? [X1] : big_p(X2,X1)
& ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X1] : big_q(X0,X1) ) )
=> ! [X1,X0] : big_q(X0,X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
? [X1] : big_p(X0,X1)
& ! [X2] :
( ? [X3] : big_p(X2,X3)
=> ! [X4] : big_q(X2,X4) ) )
=> ! [X5,X6] : big_q(X6,X5) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X5,X6] : ~ big_q(X6,X5)
& ! [X0] :
? [X1] : big_p(X0,X1)
& ! [X2] :
( ! [X4] : big_q(X2,X4)
| ! [X3] : ~ big_p(X2,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X5,X6] : ~ big_q(X6,X5)
& ! [X0] :
? [X1] : big_p(X0,X1)
& ! [X2] :
( ! [X4] : big_q(X2,X4)
| ! [X3] : ~ big_p(X2,X3) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0,X1] : ~ big_q(X1,X0)
& ! [X2] :
? [X3] : big_p(X2,X3)
& ! [X4] :
( ! [X5] : big_q(X4,X5)
| ! [X6] : ~ big_p(X4,X6) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0,X1] : ~ big_q(X1,X0)
=> ~ big_q(sK1,sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] : big_p(X2,X3)
=> big_p(X2,sK2(X2)) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ~ big_q(sK1,sK0)
& ! [X2] : big_p(X2,sK2(X2))
& ! [X4] :
( ! [X5] : big_q(X4,X5)
| ! [X6] : ~ big_p(X4,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f10,plain,
! [X6,X4,X5] :
( big_q(X4,X5)
| ~ big_p(X4,X6) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X2] : big_p(X2,sK2(X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
~ big_q(sK1,sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ big_q(sK1,sK0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
big_p(X0,sK2(X0)),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
( ~ big_p(X0,X1)
| big_q(X0,X2) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_62,plain,
~ big_p(sK1,X0),
inference(resolution,[status(thm)],[c_49,c_51]) ).
cnf(c_68,plain,
$false,
inference(resolution,[status(thm)],[c_50,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN360+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n009.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 20:41:25 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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
% 0.71/1.16 % SZS status Started for theBenchmark.p
% 0.71/1.16 % SZS status Theorem for theBenchmark.p
% 0.71/1.16
% 0.71/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.71/1.16
% 0.71/1.16 ------ iProver source info
% 0.71/1.16
% 0.71/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.71/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.71/1.16 git: non_committed_changes: false
% 0.71/1.16
% 0.71/1.16 ------ Parsing...
% 0.71/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.71/1.16
% 0.71/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s
% 0.71/1.16
% 0.71/1.16 % SZS status Theorem for theBenchmark.p
% 0.71/1.16
% 0.71/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.16
% 0.71/1.16
%------------------------------------------------------------------------------