TSTP Solution File: SYN066+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:28:55 EDT 2024
% Result : Theorem 0.74s 1.12s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 84 ( 34 ~; 25 |; 14 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 90 ( 10 sgn 46 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( big_p(X3,X1)
=> ? [X4] : big_q(X4,X1) )
& big_p(X3,X0)
& ( big_p(X2,X0)
=> big_p(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_1) ).
fof(f2,axiom,
! [X2,X0] :
( ~ big_p(X2,X0)
=> ? [X3] : big_q(X3,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_2) ).
fof(f3,axiom,
( ? [X2,X3] : big_q(X2,X3)
=> ! [X0] : big_r(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_3) ).
fof(f4,conjecture,
! [X2] :
? [X3] : big_r(X2,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37) ).
fof(f5,negated_conjecture,
~ ! [X2] :
? [X3] : big_r(X2,X3),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ~ big_p(X0,X1)
=> ? [X2] : big_q(X2,X1) ),
inference(rectify,[],[f2]) ).
fof(f7,plain,
( ? [X0,X1] : big_q(X0,X1)
=> ! [X2] : big_r(X2,X2) ),
inference(rectify,[],[f3]) ).
fof(f8,plain,
~ ! [X0] :
? [X1] : big_r(X0,X1),
inference(rectify,[],[f5]) ).
fof(f9,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ? [X4] : big_q(X4,X1)
| ~ big_p(X3,X1) )
& big_p(X3,X0)
& ( big_p(X3,X1)
| ~ big_p(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f10,plain,
! [X0,X1] :
( ? [X2] : big_q(X2,X1)
| big_p(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
( ! [X2] : big_r(X2,X2)
| ! [X0,X1] : ~ big_q(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f12,plain,
? [X0] :
! [X1] : ~ big_r(X0,X1),
inference(ennf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ( ? [X4] : big_q(X4,X1)
| ~ big_p(X3,X1) )
& big_p(X3,X0)
& ( big_p(X3,X1)
| ~ big_p(X2,X0) ) )
=> ! [X2] :
? [X3] :
( ( ? [X4] : big_q(X4,sK0(X0))
| ~ big_p(X3,sK0(X0)) )
& big_p(X3,X0)
& ( big_p(X3,sK0(X0))
| ~ big_p(X2,X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0,X2] :
( ? [X3] :
( ( ? [X4] : big_q(X4,sK0(X0))
| ~ big_p(X3,sK0(X0)) )
& big_p(X3,X0)
& ( big_p(X3,sK0(X0))
| ~ big_p(X2,X0) ) )
=> ( ( ? [X4] : big_q(X4,sK0(X0))
| ~ big_p(sK1(X0,X2),sK0(X0)) )
& big_p(sK1(X0,X2),X0)
& ( big_p(sK1(X0,X2),sK0(X0))
| ~ big_p(X2,X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ? [X4] : big_q(X4,sK0(X0))
=> big_q(sK2(X0),sK0(X0)) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X2] :
( ( big_q(sK2(X0),sK0(X0))
| ~ big_p(sK1(X0,X2),sK0(X0)) )
& big_p(sK1(X0,X2),X0)
& ( big_p(sK1(X0,X2),sK0(X0))
| ~ big_p(X2,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f15,f14,f13]) ).
fof(f17,plain,
! [X1] :
( ? [X2] : big_q(X2,X1)
=> big_q(sK3(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( big_q(sK3(X1),X1)
| big_p(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f10,f17]) ).
fof(f19,plain,
( ! [X0] : big_r(X0,X0)
| ! [X1,X2] : ~ big_q(X1,X2) ),
inference(rectify,[],[f11]) ).
fof(f20,plain,
( ? [X0] :
! [X1] : ~ big_r(X0,X1)
=> ! [X1] : ~ big_r(sK4,X1) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X1] : ~ big_r(sK4,X1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f12,f20]) ).
fof(f22,plain,
! [X2,X0] :
( big_p(sK1(X0,X2),sK0(X0))
| ~ big_p(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X2,X0] :
( big_q(sK2(X0),sK0(X0))
| ~ big_p(sK1(X0,X2),sK0(X0)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0,X1] :
( big_q(sK3(X1),X1)
| big_p(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X2,X0,X1] :
( big_r(X0,X0)
| ~ big_q(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X1] : ~ big_r(sK4,X1),
inference(cnf_transformation,[],[f21]) ).
cnf(c_49,plain,
( ~ big_p(sK1(X0,X1),sK0(X0))
| big_q(sK2(X0),sK0(X0)) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_51,plain,
( ~ big_p(X0,X1)
| big_p(sK1(X1,X0),sK0(X1)) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
( big_q(sK3(X0),X0)
| big_p(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_53,plain,
( ~ big_q(X0,X1)
| big_r(X2,X2) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
~ big_r(sK4,X0),
inference(cnf_transformation,[],[f27]) ).
cnf(c_59,plain,
( ~ big_p(sK4,sK4)
| big_p(sK1(sK4,sK4),sK0(sK4)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_81,plain,
~ big_q(X0,X1),
inference(resolution,[status(thm)],[c_53,c_54]) ).
cnf(c_87,plain,
~ big_p(sK1(X0,X1),sK0(X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_81]) ).
cnf(c_88,plain,
big_p(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_81]) ).
cnf(c_89,plain,
big_p(sK4,sK4),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_90,plain,
~ big_p(sK1(sK4,sK4),sK0(sK4)),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_91,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_90,c_89,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n010.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 20:51:49 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.74/1.12 % SZS status Started for theBenchmark.p
% 0.74/1.12 % SZS status Theorem for theBenchmark.p
% 0.74/1.12
% 0.74/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.74/1.12
% 0.74/1.12 ------ iProver source info
% 0.74/1.12
% 0.74/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.74/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.74/1.12 git: non_committed_changes: false
% 0.74/1.12
% 0.74/1.12 ------ Parsing...
% 0.74/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.74/1.12
% 0.74/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s
% 0.74/1.12
% 0.74/1.12 % SZS status Theorem for theBenchmark.p
% 0.74/1.12
% 0.74/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.12
% 0.74/1.12
%------------------------------------------------------------------------------