TSTP Solution File: SYN365+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:42 EDT 2023
% Result : Theorem 1.39s 1.16s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 3 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 121 ( 41 ~; 30 |; 36 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 0 sgn; 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2116) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( big_p(X0)
=> ( big_p(h(X0))
& big_p(g(X0)) ) )
& ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_p(X2)
& big_r(X1,g(h(X2))) ) ) )
=> ! [X3] :
( big_p(X3)
=> ? [X4] :
( big_p(X4)
& big_r(X3,X4) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
=> ( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) )
=> ( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0)
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
! [X3] :
( big_r(X3,g(h(sK1(X3))))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X3] :
( big_p(sK1(X3))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2] :
( big_p(g(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X2] :
( big_p(h(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
big_p(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ big_r(sK0,X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,negated_conjecture,
big_p(sK0),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( ~ big_p(X0)
| big_p(h(X0)) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
( ~ big_p(X0)
| big_p(g(X0)) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
( ~ big_p(X0)
| big_p(sK1(X0)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_54,negated_conjecture,
( ~ big_p(X0)
| big_r(X0,g(h(sK1(X0)))) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_55,plain,
( ~ big_p(sK0)
| big_p(sK1(sK0)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_82,plain,
( ~ big_p(g(h(sK1(sK0))))
| ~ big_p(sK0) ),
inference(resolution,[status(thm)],[c_49,c_54]) ).
cnf(c_105,plain,
( ~ big_p(h(sK1(sK0)))
| big_p(g(h(sK1(sK0)))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_106,plain,
( ~ big_p(sK1(sK0))
| big_p(h(sK1(sK0))) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_107,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_106,c_105,c_82,c_55,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 18:22:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.39/1.16 % SZS status Started for theBenchmark.p
% 1.39/1.16 % SZS status Theorem for theBenchmark.p
% 1.39/1.16
% 1.39/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.39/1.16
% 1.39/1.16 ------ iProver source info
% 1.39/1.16
% 1.39/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.39/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.39/1.16 git: non_committed_changes: false
% 1.39/1.16 git: last_make_outside_of_git: false
% 1.39/1.16
% 1.39/1.16 ------ Parsing...
% 1.39/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.39/1.16
% 1.39/1.16 ------ 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.39/1.16
% 1.39/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.39/1.16 ------ Proving...
% 1.39/1.16 ------ Problem Properties
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 clauses 5
% 1.39/1.16 conjectures 4
% 1.39/1.16 EPR 1
% 1.39/1.16 Horn 5
% 1.39/1.16 unary 2
% 1.39/1.16 binary 3
% 1.39/1.16 lits 8
% 1.39/1.16 lits eq 0
% 1.39/1.16 fd_pure 0
% 1.39/1.16 fd_pseudo 0
% 1.39/1.16 fd_cond 0
% 1.39/1.16 fd_pseudo_cond 0
% 1.39/1.16 AC symbols 0
% 1.39/1.16
% 1.39/1.16 ------ Schedule dynamic 5 is on
% 1.39/1.16
% 1.39/1.16 ------ no equalities: superposition off
% 1.39/1.16
% 1.39/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 ------
% 1.39/1.16 Current options:
% 1.39/1.16 ------
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 ------ Proving...
% 1.39/1.16
% 1.39/1.16
% 1.39/1.16 % SZS status Theorem for theBenchmark.p
% 1.39/1.16
% 1.39/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.39/1.16
% 1.39/1.16
%------------------------------------------------------------------------------