TSTP Solution File: SYN398+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:53 EDT 2023
% Result : Theorem 1.13s 1.01s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f15)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( f(X0)
& p )
<=> ( ! [X1] : f(X1)
& p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish215) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( f(X0)
& p )
<=> ( ! [X1] : f(X1)
& p ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ! [X0] :
( f(X0)
& p )
<~> ( ! [X1] : f(X1)
& p ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ? [X1] : ~ f(X1)
| ~ p
| ? [X0] :
( ~ f(X0)
| ~ p ) )
& ( ( ! [X1] : f(X1)
& p )
| ! [X0] :
( f(X0)
& p ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X1] : ~ f(X1)
| ~ p
| ? [X0] :
( ~ f(X0)
| ~ p ) )
& ( ( ! [X1] : f(X1)
& p )
| ! [X0] :
( f(X0)
& p ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ( ? [X0] : ~ f(X0)
| ~ p
| ? [X1] :
( ~ f(X1)
| ~ p ) )
& ( ( ! [X2] : f(X2)
& p )
| ! [X3] :
( f(X3)
& p ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] : ~ f(X0)
=> ~ f(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] :
( ~ f(X1)
| ~ p )
=> ( ~ f(sK1)
| ~ p ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( ~ f(sK0)
| ~ p
| ~ f(sK1)
| ~ p )
& ( ( ! [X2] : f(X2)
& p )
| ! [X3] :
( f(X3)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f13,plain,
! [X2,X3] :
( f(X2)
| f(X3) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ f(sK0)
| ~ f(sK1)
| ~ p ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,negated_conjecture,
( f(X0)
| f(X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
p,
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,plain,
f(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_59,negated_conjecture,
~ f(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_53,c_54,c_49]) ).
cnf(c_75,negated_conjecture,
( f(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_50]) ).
cnf(c_76,negated_conjecture,
sP0_iProver_split,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).
cnf(c_79,negated_conjecture,
f(X0),
inference(global_subsumption_just,[status(thm)],[c_75,c_76,c_75]) ).
cnf(c_81,plain,
$false,
inference(resolution,[status(thm)],[c_79,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Sat Aug 26 18:54:44 EDT 2023
% 0.11/0.29 % CPUTime :
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.13/1.01 % SZS status Started for theBenchmark.p
% 1.13/1.01 % SZS status Theorem for theBenchmark.p
% 1.13/1.01
% 1.13/1.01 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.13/1.01
% 1.13/1.01 ------ iProver source info
% 1.13/1.01
% 1.13/1.01 git: date: 2023-05-31 18:12:56 +0000
% 1.13/1.01 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.13/1.01 git: non_committed_changes: false
% 1.13/1.01 git: last_make_outside_of_git: false
% 1.13/1.01
% 1.13/1.01 ------ Parsing...
% 1.13/1.01 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.13/1.01
% 1.13/1.01 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.13/1.01 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.13/1.01 ------ Proving...
% 1.13/1.01 ------ Problem Properties
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01 clauses 3
% 1.13/1.01 conjectures 3
% 1.13/1.01 EPR 3
% 1.13/1.01 Horn 3
% 1.13/1.01 unary 2
% 1.13/1.01 binary 1
% 1.13/1.01 lits 4
% 1.13/1.01 lits eq 0
% 1.13/1.01 fd_pure 0
% 1.13/1.01 fd_pseudo 0
% 1.13/1.01 fd_cond 0
% 1.13/1.01 fd_pseudo_cond 0
% 1.13/1.01 AC symbols 0
% 1.13/1.01
% 1.13/1.01 ------ Schedule EPR Horn non eq is on
% 1.13/1.01
% 1.13/1.01 ------ no equalities: superposition off
% 1.13/1.01
% 1.13/1.01 ------ Option_epr_horn Time Limit: Unbounded
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01 ------
% 1.13/1.01 Current options:
% 1.13/1.01 ------
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01 ------ Proving...
% 1.13/1.01
% 1.13/1.01
% 1.13/1.01 % SZS status Theorem for theBenchmark.p
% 1.13/1.01
% 1.13/1.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.01
% 1.13/1.01
%------------------------------------------------------------------------------