TSTP Solution File: SYN361+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN361+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 Sep 1 03:06:40 EDT 2023
% Result : Theorem 0.78s 1.18s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 68 ( 27 ~; 12 |; 18 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 64 ( 2 sgn; 40 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X1,X2] :
( big_p(X1,X2)
=> ~ big_q(X1,X2) )
& ! [X1] :
( big_s(X1)
=> ? [X2] : big_q(X2,X1) )
& ? [X0] :
! [X1] : big_p(X1,X0) )
=> ? [X3] : ~ big_s(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2112) ).
fof(f2,negated_conjecture,
~ ( ( ! [X1,X2] :
( big_p(X1,X2)
=> ~ big_q(X1,X2) )
& ! [X1] :
( big_s(X1)
=> ? [X2] : big_q(X2,X1) )
& ? [X0] :
! [X1] : big_p(X1,X0) )
=> ? [X3] : ~ big_s(X3) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( big_p(X0,X1)
=> ~ big_q(X0,X1) )
& ! [X2] :
( big_s(X2)
=> ? [X3] : big_q(X3,X2) )
& ? [X4] :
! [X5] : big_p(X5,X4) )
=> ? [X6] : ~ big_s(X6) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X6] : big_s(X6)
& ! [X0,X1] :
( ~ big_q(X0,X1)
| ~ big_p(X0,X1) )
& ! [X2] :
( ? [X3] : big_q(X3,X2)
| ~ big_s(X2) )
& ? [X4] :
! [X5] : big_p(X5,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X6] : big_s(X6)
& ! [X0,X1] :
( ~ big_q(X0,X1)
| ~ big_p(X0,X1) )
& ! [X2] :
( ? [X3] : big_q(X3,X2)
| ~ big_s(X2) )
& ? [X4] :
! [X5] : big_p(X5,X4) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] : big_s(X0)
& ! [X1,X2] :
( ~ big_q(X1,X2)
| ~ big_p(X1,X2) )
& ! [X3] :
( ? [X4] : big_q(X4,X3)
| ~ big_s(X3) )
& ? [X5] :
! [X6] : big_p(X6,X5) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X3] :
( ? [X4] : big_q(X4,X3)
=> big_q(sK0(X3),X3) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X5] :
! [X6] : big_p(X6,X5)
=> ! [X6] : big_p(X6,sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X0] : big_s(X0)
& ! [X1,X2] :
( ~ big_q(X1,X2)
| ~ big_p(X1,X2) )
& ! [X3] :
( big_q(sK0(X3),X3)
| ~ big_s(X3) )
& ! [X6] : big_p(X6,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
! [X6] : big_p(X6,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X3] :
( big_q(sK0(X3),X3)
| ~ big_s(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X1] :
( ~ big_q(X1,X2)
| ~ big_p(X1,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0] : big_s(X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
big_s(X0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ big_q(X0,X1)
| ~ big_p(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
( ~ big_s(X0)
| big_q(sK0(X0),X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,negated_conjecture,
big_p(X0,sK1),
inference(cnf_transformation,[],[f10]) ).
cnf(c_57,negated_conjecture,
big_q(sK0(X0),X0),
inference(global_subsumption_just,[status(thm)],[c_51,c_49,c_51]) ).
cnf(c_70,plain,
~ big_p(sK0(X0),X0),
inference(resolution,[status(thm)],[c_50,c_57]) ).
cnf(c_76,plain,
$false,
inference(resolution,[status(thm)],[c_52,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN361+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n013.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 : Sat Aug 26 20:37:17 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.78/1.18 % SZS status Started for theBenchmark.p
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.78/1.18
% 0.78/1.18 ------ iProver source info
% 0.78/1.18
% 0.78/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.78/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.78/1.18 git: non_committed_changes: false
% 0.78/1.18 git: last_make_outside_of_git: false
% 0.78/1.18
% 0.78/1.18 ------ Parsing...
% 0.78/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.78/1.18
% 0.78/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s
% 0.78/1.18
% 0.78/1.18 % SZS status Theorem for theBenchmark.p
% 0.78/1.18
% 0.78/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.18
% 0.78/1.18
%------------------------------------------------------------------------------