TSTP Solution File: SYN354+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN354+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:16 EDT 2024
% Result : Theorem 1.89s 1.20s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 190 ( 0 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 255 ( 88 ~; 91 |; 54 &)
% ( 6 <=>; 14 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 8 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-2 aty)
% Number of variables : 59 ( 1 sgn 28 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_20_1) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) )
=> ( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2,X3] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f10,plain,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X3] :
( big_f(sK1,X3)
| ~ big_f(X2,X3)
| big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X2,X3] :
( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(X0,X1)
| ~ big_f(sK1,X0)
| ~ big_f(sK0,X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,negated_conjecture,
( ~ big_g(X0,sK2(X1,X0))
| ~ big_g(sK1,sK2(X1,X0))
| ~ big_f(X1,X0)
| big_f(sK1,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(X1,sK2(X0,X1))
| big_g(sK1,sK2(X0,X1))
| big_f(sK1,X1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_55,negated_conjecture,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f10]) ).
cnf(c_56,plain,
( ~ big_f(sK1,sK1)
| ~ big_f(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_165,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(X1,sK2(X0,X1))
| big_g(sK1,sK2(X0,X1))
| big_f(sK1,X1) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_166,negated_conjecture,
( ~ big_g(X0,sK2(X1,X0))
| ~ big_g(sK1,sK2(X1,X0))
| ~ big_f(X1,X0)
| big_f(sK1,X0) ),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_170,plain,
( ~ big_f(sK0,sK1)
| big_g(sK1,sK2(sK0,sK1))
| big_f(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_171,plain,
( ~ big_g(sK1,sK2(sK0,sK1))
| ~ big_f(sK0,sK1)
| big_f(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_172,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_171,c_170,c_56,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN354+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 21:22:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 1.89/1.20 % SZS status Started for theBenchmark.p
% 1.89/1.20 % SZS status Theorem for theBenchmark.p
% 1.89/1.20
% 1.89/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.89/1.20
% 1.89/1.20 ------ iProver source info
% 1.89/1.20
% 1.89/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.89/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.89/1.20 git: non_committed_changes: false
% 1.89/1.20
% 1.89/1.20 ------ Parsing...
% 1.89/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.89/1.20
% 1.89/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.89/1.20
% 1.89/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.89/1.20 ------ Proving...
% 1.89/1.20 ------ Problem Properties
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20 clauses 6
% 1.89/1.20 conjectures 6
% 1.89/1.20 EPR 2
% 1.89/1.20 Horn 5
% 1.89/1.20 unary 1
% 1.89/1.20 binary 2
% 1.89/1.20 lits 16
% 1.89/1.20 lits eq 0
% 1.89/1.20 fd_pure 0
% 1.89/1.20 fd_pseudo 0
% 1.89/1.20 fd_cond 0
% 1.89/1.20 fd_pseudo_cond 0
% 1.89/1.20 AC symbols 0
% 1.89/1.20
% 1.89/1.20 ------ Schedule dynamic 5 is on
% 1.89/1.20
% 1.89/1.20 ------ no equalities: superposition off
% 1.89/1.20
% 1.89/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20 ------
% 1.89/1.20 Current options:
% 1.89/1.20 ------
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20 ------ Proving...
% 1.89/1.20
% 1.89/1.20
% 1.89/1.20 % SZS status Theorem for theBenchmark.p
% 1.89/1.20
% 1.89/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.89/1.20
% 1.89/1.20
%------------------------------------------------------------------------------