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