TSTP Solution File: SYN328+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:24 EDT 2023
% Result : Theorem 1.64s 1.11s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 63 ( 1 unt; 0 def)
% Number of atoms : 306 ( 0 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 391 ( 148 ~; 154 |; 62 &)
% ( 12 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn; 21 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1,X2] :
( ( ( big_f(X1)
=> big_g(X1) )
<=> big_f(X0) )
=> ( ( ( big_f(X1)
=> big_h(X1) )
<=> big_g(X0) )
=> ( ( ( ( big_f(X1)
=> big_g(X1) )
=> big_h(X1) )
<=> big_h(X0) )
=> ( big_h(X2)
& big_g(X2)
& big_f(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_3) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1,X2] :
( ( ( big_f(X1)
=> big_g(X1) )
<=> big_f(X0) )
=> ( ( ( big_f(X1)
=> big_h(X1) )
<=> big_g(X0) )
=> ( ( ( ( big_f(X1)
=> big_g(X1) )
=> big_h(X1) )
<=> big_h(X0) )
=> ( big_h(X2)
& big_g(X2)
& big_f(X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1,X2] :
( ( ~ big_h(X2)
| ~ big_g(X2)
| ~ big_f(X2) )
& ( ( big_h(X1)
| ( ~ big_g(X1)
& big_f(X1) ) )
<=> big_h(X0) )
& ( ( big_h(X1)
| ~ big_f(X1) )
<=> big_g(X0) )
& ( ( big_g(X1)
| ~ big_f(X1) )
<=> big_f(X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1,X2] :
( ( ~ big_h(X2)
| ~ big_g(X2)
| ~ big_f(X2) )
& ( ( big_h(X1)
| ( ~ big_g(X1)
& big_f(X1) ) )
<=> big_h(X0) )
& ( ( big_h(X1)
| ~ big_f(X1) )
<=> big_g(X0) )
& ( ( big_g(X1)
| ~ big_f(X1) )
<=> big_f(X0) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1,X2] :
( ( ~ big_h(X2)
| ~ big_g(X2)
| ~ big_f(X2) )
& ( big_h(X1)
| ( ~ big_g(X1)
& big_f(X1) )
| ~ big_h(X0) )
& ( big_h(X0)
| ( ~ big_h(X1)
& ( big_g(X1)
| ~ big_f(X1) ) ) )
& ( big_h(X1)
| ~ big_f(X1)
| ~ big_g(X0) )
& ( big_g(X0)
| ( ~ big_h(X1)
& big_f(X1) ) )
& ( big_g(X1)
| ~ big_f(X1)
| ~ big_f(X0) )
& ( big_f(X0)
| ( ~ big_g(X1)
& big_f(X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0] :
? [X1,X2] :
( ( ~ big_h(X2)
| ~ big_g(X2)
| ~ big_f(X2) )
& ( big_h(X1)
| ( ~ big_g(X1)
& big_f(X1) )
| ~ big_h(X0) )
& ( big_h(X0)
| ( ~ big_h(X1)
& ( big_g(X1)
| ~ big_f(X1) ) ) )
& ( big_h(X1)
| ~ big_f(X1)
| ~ big_g(X0) )
& ( big_g(X0)
| ( ~ big_h(X1)
& big_f(X1) ) )
& ( big_g(X1)
| ~ big_f(X1)
| ~ big_f(X0) )
& ( big_f(X0)
| ( ~ big_g(X1)
& big_f(X1) ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ? [X1,X2] :
( ( ~ big_h(X2)
| ~ big_g(X2)
| ~ big_f(X2) )
& ( big_h(X1)
| ( ~ big_g(X1)
& big_f(X1) )
| ~ big_h(X0) )
& ( big_h(X0)
| ( ~ big_h(X1)
& ( big_g(X1)
| ~ big_f(X1) ) ) )
& ( big_h(X1)
| ~ big_f(X1)
| ~ big_g(X0) )
& ( big_g(X0)
| ( ~ big_h(X1)
& big_f(X1) ) )
& ( big_g(X1)
| ~ big_f(X1)
| ~ big_f(X0) )
& ( big_f(X0)
| ( ~ big_g(X1)
& big_f(X1) ) ) )
=> ( ( ~ big_h(sK1(X0))
| ~ big_g(sK1(X0))
| ~ big_f(sK1(X0)) )
& ( big_h(sK0(X0))
| ( ~ big_g(sK0(X0))
& big_f(sK0(X0)) )
| ~ big_h(X0) )
& ( big_h(X0)
| ( ~ big_h(sK0(X0))
& ( big_g(sK0(X0))
| ~ big_f(sK0(X0)) ) ) )
& ( big_h(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_g(X0) )
& ( big_g(X0)
| ( ~ big_h(sK0(X0))
& big_f(sK0(X0)) ) )
& ( big_g(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_f(X0) )
& ( big_f(X0)
| ( ~ big_g(sK0(X0))
& big_f(sK0(X0)) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0] :
( ( ~ big_h(sK1(X0))
| ~ big_g(sK1(X0))
| ~ big_f(sK1(X0)) )
& ( big_h(sK0(X0))
| ( ~ big_g(sK0(X0))
& big_f(sK0(X0)) )
| ~ big_h(X0) )
& ( big_h(X0)
| ( ~ big_h(sK0(X0))
& ( big_g(sK0(X0))
| ~ big_f(sK0(X0)) ) ) )
& ( big_h(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_g(X0) )
& ( big_g(X0)
| ( ~ big_h(sK0(X0))
& big_f(sK0(X0)) ) )
& ( big_g(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_f(X0) )
& ( big_f(X0)
| ( ~ big_g(sK0(X0))
& big_f(sK0(X0)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
fof(f9,plain,
! [X0] :
( big_f(X0)
| big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0] :
( big_f(X0)
| ~ big_g(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0] :
( big_g(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X0] :
( big_g(X0)
| big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0] :
( big_g(X0)
| ~ big_h(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0] :
( big_h(sK0(X0))
| ~ big_f(sK0(X0))
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0] :
( big_h(X0)
| big_g(sK0(X0))
| ~ big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0] :
( big_h(X0)
| ~ big_h(sK0(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0] :
( big_h(sK0(X0))
| big_f(sK0(X0))
| ~ big_h(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0] :
( big_h(sK0(X0))
| ~ big_g(sK0(X0))
| ~ big_h(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f19,plain,
! [X0] :
( ~ big_h(sK1(X0))
| ~ big_g(sK1(X0))
| ~ big_f(sK1(X0)) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ big_h(sK1(X0))
| ~ big_g(sK1(X0))
| ~ big_f(sK1(X0)) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,negated_conjecture,
( ~ big_g(sK0(X0))
| ~ big_h(X0)
| big_h(sK0(X0)) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,negated_conjecture,
( ~ big_h(X0)
| big_h(sK0(X0))
| big_f(sK0(X0)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_52,negated_conjecture,
( ~ big_h(sK0(X0))
| big_h(X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_53,negated_conjecture,
( ~ big_f(sK0(X0))
| big_g(sK0(X0))
| big_h(X0) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_54,negated_conjecture,
( ~ big_f(sK0(X0))
| ~ big_g(X0)
| big_h(sK0(X0)) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_55,negated_conjecture,
( ~ big_h(sK0(X0))
| big_g(X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_56,negated_conjecture,
( big_f(sK0(X0))
| big_g(X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_57,negated_conjecture,
( ~ big_f(sK0(X0))
| ~ big_f(X0)
| big_g(sK0(X0)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_58,negated_conjecture,
( ~ big_g(sK0(X0))
| big_f(X0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_59,negated_conjecture,
( big_f(sK0(X0))
| big_f(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_128,plain,
( ~ big_f(sK0(X0))
| ~ big_h(X0)
| ~ big_f(X0)
| big_h(sK0(X0)) ),
inference(resolution,[status(thm)],[c_57,c_50]) ).
cnf(c_130,plain,
( ~ big_h(X0)
| ~ big_f(X0)
| big_h(sK0(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_128,c_51,c_128]) ).
cnf(c_142,plain,
( ~ big_f(sK0(X0))
| big_h(X0)
| big_f(X0) ),
inference(resolution,[status(thm)],[c_53,c_58]) ).
cnf(c_144,plain,
( big_h(X0)
| big_f(X0) ),
inference(global_subsumption_just,[status(thm)],[c_142,c_59,c_142]) ).
cnf(c_156,plain,
( ~ big_h(sK1(X0))
| ~ big_f(sK1(X0))
| big_f(sK0(sK1(X0))) ),
inference(resolution,[status(thm)],[c_49,c_56]) ).
cnf(c_164,plain,
( ~ big_h(sK1(X0))
| big_f(sK0(sK1(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_156,c_59]) ).
cnf(c_167,plain,
( ~ big_h(sK1(iProver_bot))
| big_f(sK0(sK1(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_164]) ).
cnf(c_168,plain,
( ~ big_h(sK0(sK1(X0)))
| ~ big_h(sK1(X0))
| ~ big_f(sK1(X0)) ),
inference(resolution,[status(thm)],[c_49,c_55]) ).
cnf(c_169,plain,
( ~ big_h(sK0(sK1(iProver_bot)))
| ~ big_h(sK1(iProver_bot))
| ~ big_f(sK1(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_168]) ).
cnf(c_179,plain,
( ~ big_f(sK0(sK0(X0)))
| ~ big_f(sK0(X0))
| ~ big_f(X0)
| big_h(sK0(sK0(X0))) ),
inference(resolution,[status(thm)],[c_57,c_54]) ).
cnf(c_185,plain,
( ~ big_f(sK0(X0))
| ~ big_f(X0)
| big_h(sK0(sK0(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_179,c_144]) ).
cnf(c_193,plain,
( ~ big_f(sK0(sK0(X0)))
| ~ big_f(sK0(X0))
| big_h(sK0(sK0(X0)))
| big_h(X0) ),
inference(resolution,[status(thm)],[c_53,c_54]) ).
cnf(c_195,plain,
( ~ big_f(sK0(X0))
| big_h(sK0(sK0(X0)))
| big_h(X0) ),
inference(global_subsumption_just,[status(thm)],[c_193,c_142,c_185]) ).
cnf(c_215,plain,
( ~ big_h(sK0(sK0(X0)))
| big_f(X0) ),
inference(resolution,[status(thm)],[c_58,c_55]) ).
cnf(c_260,plain,
( big_h(sK0(X0))
| big_f(sK0(X0)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_272,plain,
( ~ big_h(sK0(sK1(X0)))
| big_h(sK1(X0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_273,plain,
( ~ big_h(sK0(sK1(iProver_bot)))
| big_h(sK1(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_272]) ).
cnf(c_280,plain,
( big_h(sK0(sK0(X0)))
| big_f(sK0(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_260]) ).
cnf(c_282,plain,
( ~ big_h(sK0(X0))
| ~ big_f(sK0(X0))
| big_h(sK0(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_130]) ).
cnf(c_287,plain,
( ~ big_h(sK0(sK0(sK0(X0))))
| big_h(sK0(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_297,plain,
( ~ big_h(sK0(sK0(sK1(X0))))
| big_h(sK0(sK1(X0))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_298,plain,
( ~ big_f(sK0(sK0(sK1(X0))))
| big_h(sK0(sK0(sK0(sK1(X0)))))
| big_h(sK0(sK1(X0))) ),
inference(instantiation,[status(thm)],[c_195]) ).
cnf(c_299,plain,
( ~ big_f(sK0(sK0(sK1(iProver_bot))))
| big_h(sK0(sK0(sK0(sK1(iProver_bot)))))
| big_h(sK0(sK1(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_298]) ).
cnf(c_300,plain,
( ~ big_h(sK0(sK0(sK1(iProver_bot))))
| big_h(sK0(sK1(iProver_bot))) ),
inference(instantiation,[status(thm)],[c_297]) ).
cnf(c_332,plain,
( ~ big_h(sK0(sK1(X0)))
| ~ big_f(sK0(sK1(X0)))
| big_h(sK0(sK0(sK1(X0)))) ),
inference(instantiation,[status(thm)],[c_282]) ).
cnf(c_334,plain,
( big_h(sK0(sK0(sK1(X0))))
| big_f(sK0(sK0(sK1(X0)))) ),
inference(instantiation,[status(thm)],[c_280]) ).
cnf(c_335,plain,
( ~ big_h(sK0(sK0(sK0(sK1(X0)))))
| big_h(sK0(sK0(sK1(X0)))) ),
inference(instantiation,[status(thm)],[c_287]) ).
cnf(c_338,plain,
( ~ big_h(sK0(sK0(sK0(sK1(iProver_bot)))))
| big_h(sK0(sK0(sK1(iProver_bot)))) ),
inference(instantiation,[status(thm)],[c_335]) ).
cnf(c_339,plain,
( big_h(sK0(sK0(sK1(iProver_bot))))
| big_f(sK0(sK0(sK1(iProver_bot)))) ),
inference(instantiation,[status(thm)],[c_334]) ).
cnf(c_341,plain,
( ~ big_h(sK0(sK1(iProver_bot)))
| ~ big_f(sK0(sK1(iProver_bot)))
| big_h(sK0(sK0(sK1(iProver_bot)))) ),
inference(instantiation,[status(thm)],[c_332]) ).
cnf(c_344,plain,
( ~ big_h(sK0(sK0(sK1(X0))))
| big_f(sK1(X0)) ),
inference(instantiation,[status(thm)],[c_215]) ).
cnf(c_345,plain,
( ~ big_h(sK0(sK0(sK1(iProver_bot))))
| big_f(sK1(iProver_bot)) ),
inference(instantiation,[status(thm)],[c_344]) ).
cnf(c_347,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_345,c_341,c_339,c_338,c_300,c_299,c_273,c_169,c_167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.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.20/0.34 % CPULimit : 300
% 0.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Sat Aug 26 21:19:13 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.64/1.11 % SZS status Started for theBenchmark.p
% 1.64/1.11 % SZS status Theorem for theBenchmark.p
% 1.64/1.11
% 1.64/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.64/1.11
% 1.64/1.11 ------ iProver source info
% 1.64/1.11
% 1.64/1.11 git: date: 2023-05-31 18:12:56 +0000
% 1.64/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.64/1.11 git: non_committed_changes: false
% 1.64/1.11 git: last_make_outside_of_git: false
% 1.64/1.11
% 1.64/1.11 ------ Parsing...
% 1.64/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.64/1.11
% 1.64/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e
% 1.64/1.11
% 1.64/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.64/1.11 ------ Proving...
% 1.64/1.11 ------ Problem Properties
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11 clauses 11
% 1.64/1.11 conjectures 2
% 1.64/1.11 EPR 1
% 1.64/1.11 Horn 6
% 1.64/1.11 unary 0
% 1.64/1.11 binary 7
% 1.64/1.11 lits 26
% 1.64/1.11 lits eq 0
% 1.64/1.11 fd_pure 0
% 1.64/1.11 fd_pseudo 0
% 1.64/1.11 fd_cond 0
% 1.64/1.11 fd_pseudo_cond 0
% 1.64/1.11 AC symbols 0
% 1.64/1.11
% 1.64/1.11 ------ Schedule dynamic 5 is on
% 1.64/1.11
% 1.64/1.11 ------ no equalities: superposition off
% 1.64/1.11
% 1.64/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11 ------
% 1.64/1.11 Current options:
% 1.64/1.11 ------
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11 ------ Proving...
% 1.64/1.11
% 1.64/1.11
% 1.64/1.11 % SZS status Theorem for theBenchmark.p
% 1.64/1.11
% 1.64/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.11
% 1.64/1.11
%------------------------------------------------------------------------------