TSTP Solution File: SYN319+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:19 EDT 2023
% Result : Theorem 1.52s 1.18s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f16)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2,X3] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_5) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2,X3] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2,X3] :
( ( ( ~ big_h(X3)
& ( big_g(X3)
| big_f(X3) )
& big_h(X1) )
| ~ big_h(X3) )
& ( big_h(X0)
| ( ~ big_g(X0)
& ~ big_f(X0) ) )
& ( ( ~ big_f(X2)
& big_g(X0) )
| ( ~ big_g(X2)
& big_f(X1) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2,X3] :
( ( ( ~ big_h(X3)
& ( big_g(X3)
| big_f(X3) )
& big_h(X1) )
| ~ big_h(X3) )
& ( big_h(X0)
| ( ~ big_g(X0)
& ~ big_f(X0) ) )
& ( ( ~ big_f(X2)
& big_g(X0) )
| ( ~ big_g(X2)
& big_f(X1) ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( ? [X2,X3] :
( ( ( ~ big_h(X3)
& ( big_g(X3)
| big_f(X3) )
& big_h(X1) )
| ~ big_h(X3) )
& ( big_h(X0)
| ( ~ big_g(X0)
& ~ big_f(X0) ) )
& ( ( ~ big_f(X2)
& big_g(X0) )
| ( ~ big_g(X2)
& big_f(X1) ) ) )
=> ( ( ( ~ big_h(sK1(X0,X1))
& ( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1)) )
& big_h(X1) )
| ~ big_h(sK1(X0,X1)) )
& ( big_h(X0)
| ( ~ big_g(X0)
& ~ big_f(X0) ) )
& ( ( ~ big_f(sK0(X0,X1))
& big_g(X0) )
| ( ~ big_g(sK0(X0,X1))
& big_f(X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0,X1] :
( ( ( ~ big_h(sK1(X0,X1))
& ( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1)) )
& big_h(X1) )
| ~ big_h(sK1(X0,X1)) )
& ( big_h(X0)
| ( ~ big_g(X0)
& ~ big_f(X0) ) )
& ( ( ~ big_f(sK0(X0,X1))
& big_g(X0) )
| ( ~ big_g(sK0(X0,X1))
& big_f(X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f7,plain,
! [X0,X1] :
( big_g(X0)
| big_f(X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X0] :
( big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X0] :
( big_h(X0)
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f14,plain,
! [X0,X1] :
( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1))
| ~ big_h(sK1(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ big_h(sK1(X0,X1)),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,negated_conjecture,
( ~ big_h(sK1(X0,X1))
| big_g(sK1(X0,X1))
| big_f(sK1(X0,X1)) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_52,negated_conjecture,
( ~ big_g(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
( ~ big_f(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_57,negated_conjecture,
( big_g(X0)
| big_f(X1) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_67,negated_conjecture,
~ big_h(sK1(X0,X1)),
inference(global_subsumption_just,[status(thm)],[c_50,c_49]) ).
cnf(c_95,plain,
~ big_f(sK1(X0,X1)),
inference(resolution,[status(thm)],[c_67,c_53]) ).
cnf(c_100,plain,
~ big_g(sK1(X0,X1)),
inference(resolution,[status(thm)],[c_67,c_52]) ).
cnf(c_127,negated_conjecture,
( big_f(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_57]) ).
cnf(c_128,negated_conjecture,
( big_g(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_57]) ).
cnf(c_129,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_57]) ).
cnf(c_132,plain,
( ~ sP0_iProver_split
| big_f(sK1(X0,X1)) ),
inference(instantiation,[status(thm)],[c_127]) ).
cnf(c_138,plain,
( ~ sP1_iProver_split
| big_g(sK1(X0,X1)) ),
inference(instantiation,[status(thm)],[c_128]) ).
cnf(c_139,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_138,c_132,c_129,c_100,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 19:07:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.52/1.18 % SZS status Started for theBenchmark.p
% 1.52/1.18 % SZS status Theorem for theBenchmark.p
% 1.52/1.18
% 1.52/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.52/1.18
% 1.52/1.18 ------ iProver source info
% 1.52/1.18
% 1.52/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.52/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.52/1.18 git: non_committed_changes: false
% 1.52/1.18 git: last_make_outside_of_git: false
% 1.52/1.18
% 1.52/1.18 ------ Parsing...
% 1.52/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.52/1.18
% 1.52/1.18 ------ 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.52/1.18
% 1.52/1.18 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.18 ------ Proving...
% 1.52/1.18 ------ Problem Properties
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18 clauses 8
% 1.52/1.18 conjectures 6
% 1.52/1.18 EPR 3
% 1.52/1.18 Horn 7
% 1.52/1.18 unary 2
% 1.52/1.18 binary 6
% 1.52/1.18 lits 14
% 1.52/1.18 lits eq 0
% 1.52/1.18 fd_pure 0
% 1.52/1.18 fd_pseudo 0
% 1.52/1.18 fd_cond 0
% 1.52/1.18 fd_pseudo_cond 0
% 1.52/1.18 AC symbols 0
% 1.52/1.18
% 1.52/1.18 ------ Schedule dynamic 5 is on
% 1.52/1.18
% 1.52/1.18 ------ no equalities: superposition off
% 1.52/1.18
% 1.52/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18 ------
% 1.52/1.18 Current options:
% 1.52/1.18 ------
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18 ------ Proving...
% 1.52/1.18
% 1.52/1.18
% 1.52/1.18 % SZS status Theorem for theBenchmark.p
% 1.52/1.18
% 1.52/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.18
% 1.52/1.18
%------------------------------------------------------------------------------