TSTP Solution File: SYN414+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN414+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:58 EDT 2023
% Result : CounterSatisfiable 1.11s 1.17s
% Output : Saturation 1.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( ? [X1] :
( f(X1)
& h(X0,X1) )
=> ? [X2] :
( g(X2)
& h(X0,X2) ) )
<=> ! [X3,X4,X5] :
( ( f(X4)
& h(X3,X4) )
=> ( g(X5)
& h(X3,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish265) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ? [X1] :
( f(X1)
& h(X0,X1) )
=> ? [X2] :
( g(X2)
& h(X0,X2) ) )
<=> ! [X3,X4,X5] :
( ( f(X4)
& h(X3,X4) )
=> ( g(X5)
& h(X3,X5) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X0] :
( ? [X2] :
( g(X2)
& h(X0,X2) )
| ! [X1] :
( ~ f(X1)
| ~ h(X0,X1) ) )
<~> ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( ? [X2] :
( g(X2)
& h(X0,X2) )
| ! [X1] :
( ~ f(X1)
| ~ h(X0,X1) ) )
<~> ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
( sP0
<=> ! [X0] :
( ? [X2] :
( g(X2)
& h(X0,X2) )
| ! [X1] :
( ~ f(X1)
| ~ h(X0,X1) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f6,plain,
( sP0
<~> ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) ) ),
inference(definition_folding,[],[f4,f5]) ).
fof(f7,plain,
( ( sP0
| ? [X0] :
( ! [X2] :
( ~ g(X2)
| ~ h(X0,X2) )
& ? [X1] :
( f(X1)
& h(X0,X1) ) ) )
& ( ! [X0] :
( ? [X2] :
( g(X2)
& h(X0,X2) )
| ! [X1] :
( ~ f(X1)
| ~ h(X0,X1) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f8,plain,
( ( sP0
| ? [X0] :
( ! [X1] :
( ~ g(X1)
| ~ h(X0,X1) )
& ? [X2] :
( f(X2)
& h(X0,X2) ) ) )
& ( ! [X3] :
( ? [X4] :
( g(X4)
& h(X3,X4) )
| ! [X5] :
( ~ f(X5)
| ~ h(X3,X5) ) )
| ~ sP0 ) ),
inference(rectify,[],[f7]) ).
fof(f9,plain,
( ? [X0] :
( ! [X1] :
( ~ g(X1)
| ~ h(X0,X1) )
& ? [X2] :
( f(X2)
& h(X0,X2) ) )
=> ( ! [X1] :
( ~ g(X1)
| ~ h(sK1,X1) )
& ? [X2] :
( f(X2)
& h(sK1,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X2] :
( f(X2)
& h(sK1,X2) )
=> ( f(sK2)
& h(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X3] :
( ? [X4] :
( g(X4)
& h(X3,X4) )
=> ( g(sK3(X3))
& h(X3,sK3(X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ( sP0
| ( ! [X1] :
( ~ g(X1)
| ~ h(sK1,X1) )
& f(sK2)
& h(sK1,sK2) ) )
& ( ! [X3] :
( ( g(sK3(X3))
& h(X3,sK3(X3)) )
| ! [X5] :
( ~ f(X5)
| ~ h(X3,X5) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f8,f11,f10,f9]) ).
fof(f13,plain,
( ( ? [X3,X4,X5] :
( ( ~ g(X5)
| ~ h(X3,X5) )
& f(X4)
& h(X3,X4) )
| ~ sP0 )
& ( ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) )
| sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f14,plain,
( ( ? [X0,X1,X2] :
( ( ~ g(X2)
| ~ h(X0,X2) )
& f(X1)
& h(X0,X1) )
| ~ sP0 )
& ( ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) )
| sP0 ) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
( ? [X0,X1,X2] :
( ( ~ g(X2)
| ~ h(X0,X2) )
& f(X1)
& h(X0,X1) )
=> ( ( ~ g(sK6)
| ~ h(sK4,sK6) )
& f(sK5)
& h(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ( ( ~ g(sK6)
| ~ h(sK4,sK6) )
& f(sK5)
& h(sK4,sK5) )
| ~ sP0 )
& ( ! [X3,X4,X5] :
( ( g(X5)
& h(X3,X5) )
| ~ f(X4)
| ~ h(X3,X4) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f14,f15]) ).
fof(f17,plain,
! [X3,X5] :
( h(X3,sK3(X3))
| ~ f(X5)
| ~ h(X3,X5)
| ~ sP0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X3,X5] :
( g(sK3(X3))
| ~ f(X5)
| ~ h(X3,X5)
| ~ sP0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
( sP0
| h(sK1,sK2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
( sP0
| f(sK2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X1] :
( sP0
| ~ g(X1)
| ~ h(sK1,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
! [X3,X4,X5] :
( h(X3,X5)
| ~ f(X4)
| ~ h(X3,X4)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
! [X3,X4,X5] :
( g(X5)
| ~ f(X4)
| ~ h(X3,X4)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
( h(sK4,sK5)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
( f(sK5)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
( ~ g(sK6)
| ~ h(sK4,sK6)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
( ~ h(sK1,X0)
| ~ g(X0)
| sP0 ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_50,plain,
( f(sK2)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_51,plain,
( h(sK1,sK2)
| sP0 ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
( ~ h(X0,X1)
| ~ f(X1)
| ~ sP0
| g(sK3(X0)) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_53,plain,
( ~ h(X0,X1)
| ~ f(X1)
| ~ sP0
| h(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,negated_conjecture,
( ~ h(sK4,sK6)
| ~ g(sK6)
| ~ sP0 ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_55,negated_conjecture,
( ~ sP0
| f(sK5) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,negated_conjecture,
( ~ sP0
| h(sK4,sK5) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,negated_conjecture,
( ~ h(X0,X1)
| ~ f(X1)
| g(X2)
| sP0 ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_58,negated_conjecture,
( ~ h(X0,X1)
| ~ f(X1)
| h(X0,X2)
| sP0 ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_99,plain,
( ~ h(X0,X1)
| ~ f(X1)
| g(sK3(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_57]) ).
cnf(c_115,plain,
( ~ h(X0,X1)
| ~ f(X1)
| h(X0,sK3(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN414+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 19:45:59 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.11/1.17 % SZS status Started for theBenchmark.p
% 1.11/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.11/1.17
% 1.11/1.17 ------ iProver source info
% 1.11/1.17
% 1.11/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.11/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.11/1.17 git: non_committed_changes: false
% 1.11/1.17 git: last_make_outside_of_git: false
% 1.11/1.17
% 1.11/1.17 ------ Parsing...
% 1.11/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.11/1.17
% 1.11/1.17 ------ Preprocessing... sf_s rm: 10 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.11/1.17
% 1.11/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.11/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.11/1.17 ------ Proving...
% 1.11/1.17 ------ Problem Properties
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17 clauses 0
% 1.11/1.17 conjectures 0
% 1.11/1.17 EPR 0
% 1.11/1.17 Horn 0
% 1.11/1.17 unary 0
% 1.11/1.17 binary 0
% 1.11/1.17 lits 0
% 1.11/1.17 lits eq 0
% 1.11/1.17 fd_pure 0
% 1.11/1.17 fd_pseudo 0
% 1.11/1.17 fd_cond 0
% 1.11/1.17 fd_pseudo_cond 0
% 1.11/1.17 AC symbols 0
% 1.11/1.17
% 1.11/1.17 ------ Schedule EPR Horn non eq is on
% 1.11/1.17
% 1.11/1.17 ------ no conjectures: strip conj schedule
% 1.11/1.17
% 1.11/1.17 ------ no equalities: superposition off
% 1.11/1.17
% 1.11/1.17 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.11/1.17
% 1.11/1.17
%------------------------------------------------------------------------------