TSTP Solution File: SYN326+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN326+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:23 EDT 2023
% Result : Theorem 0.79s 1.18s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 87 ( 23 ~; 17 |; 30 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 27 ( 2 sgn; 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_1) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0] :
( ? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) ) ) )
=> ( ~ big_f(sK1(X0),sK1(X0))
& big_f(X0,sK0(X0))
& ( big_h(sK1(X0))
| ( ~ big_g(X0)
& big_f(sK1(X0),X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(sK0(X0))
& big_f(sK0(X0),sK1(X0)) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0] :
( ~ big_f(sK1(X0),sK1(X0))
& big_f(X0,sK0(X0))
& ( big_h(sK1(X0))
| ( ~ big_g(X0)
& big_f(sK1(X0),X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(sK0(X0))
& big_f(sK0(X0),sK1(X0)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f8,plain,
! [X0] :
( big_f(X0,X0)
| big_g(sK0(X0)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0] :
( big_f(X0,X0)
| ~ big_h(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X0] :
( big_h(sK1(X0))
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f13,plain,
! [X0] : ~ big_f(sK1(X0),sK1(X0)),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ big_f(sK1(X0),sK1(X0)),
inference(cnf_transformation,[],[f13]) ).
cnf(c_51,negated_conjecture,
( ~ big_g(X0)
| big_h(sK1(X0)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_53,negated_conjecture,
( ~ big_h(X0)
| big_f(X0,X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_54,negated_conjecture,
( big_f(X0,X0)
| big_g(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_87,plain,
( big_h(sK1(sK0(X0)))
| big_f(X0,X0) ),
inference(resolution,[status(thm)],[c_51,c_54]) ).
cnf(c_97,plain,
big_h(sK1(sK0(sK1(X0)))),
inference(resolution,[status(thm)],[c_49,c_87]) ).
cnf(c_102,plain,
~ big_h(sK1(X0)),
inference(resolution,[status(thm)],[c_49,c_53]) ).
cnf(c_107,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN326+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n023.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 22:08:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.79/1.18 % SZS status Started for theBenchmark.p
% 0.79/1.18 % SZS status Theorem for theBenchmark.p
% 0.79/1.18
% 0.79/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.79/1.18
% 0.79/1.18 ------ iProver source info
% 0.79/1.18
% 0.79/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.79/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.79/1.18 git: non_committed_changes: false
% 0.79/1.18 git: last_make_outside_of_git: false
% 0.79/1.18
% 0.79/1.18 ------ Parsing...
% 0.79/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.79/1.18
% 0.79/1.18 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe:1:0s
% 0.79/1.18
% 0.79/1.18 % SZS status Theorem for theBenchmark.p
% 0.79/1.18
% 0.79/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.79/1.18
% 0.79/1.18
%------------------------------------------------------------------------------