TSTP Solution File: SYN934+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN934+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 May 3 03:33:38 EDT 2024
% Result : Theorem 1.69s 1.21s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f17)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( c
=> p(X0) )
<=> ( c
=> ? [X0] : p(X0) ) ),
file('/export/starexec/sandbox2/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] :
( p(X0)
| ~ c )
<~> ( ? [X1] : p(X1)
| ~ c ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ( ! [X1] : ~ p(X1)
& c )
| ! [X0] :
( ~ p(X0)
& c ) )
& ( ? [X1] : p(X1)
| ~ c
| ? [X0] :
( p(X0)
| ~ c ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ( ! [X1] : ~ p(X1)
& c )
| ! [X0] :
( ~ p(X0)
& c ) )
& ( ? [X1] : p(X1)
| ~ c
| ? [X0] :
( p(X0)
| ~ c ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ( ! [X0] : ~ p(X0)
& c )
| ! [X1] :
( ~ p(X1)
& c ) )
& ( ? [X2] : p(X2)
| ~ c
| ? [X3] :
( p(X3)
| ~ c ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ? [X2] : p(X2)
=> p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X3] :
( p(X3)
| ~ c )
=> ( p(sK1)
| ~ c ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ( ( ! [X0] : ~ p(X0)
& c )
| ! [X1] :
( ~ p(X1)
& c ) )
& ( p(sK0)
| ~ c
| p(sK1)
| ~ c ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f15,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_49,negated_conjecture,
( ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_52,negated_conjecture,
c,
inference(cnf_transformation,[],[f16]) ).
cnf(c_53,negated_conjecture,
( ~ c
| p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,plain,
~ p(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_59,negated_conjecture,
p(sK1),
inference(global_subsumption_just,[status(thm)],[c_53,c_52,c_53,c_54]) ).
cnf(c_75,negated_conjecture,
( ~ p(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_49]) ).
cnf(c_76,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_77,negated_conjecture,
p(sK1),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_78,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_76]) ).
cnf(c_80,negated_conjecture,
( ~ p(X0)
| ~ sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_75]) ).
cnf(c_83,negated_conjecture,
~ p(X0),
inference(global_subsumption_just,[status(thm)],[c_80,c_78,c_80]) ).
cnf(c_85,plain,
$false,
inference(resolution,[status(thm)],[c_83,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN934+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.15 % Command : run_iprover %s %d THM
% 0.16/0.37 % Computer : n002.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu May 2 21:09:57 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.69/1.21 % SZS status Started for theBenchmark.p
% 1.69/1.21 % SZS status Theorem for theBenchmark.p
% 1.69/1.21
% 1.69/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.69/1.21
% 1.69/1.21 ------ iProver source info
% 1.69/1.21
% 1.69/1.21 git: date: 2024-05-02 19:28:25 +0000
% 1.69/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.69/1.21 git: non_committed_changes: false
% 1.69/1.21
% 1.69/1.21 ------ Parsing...
% 1.69/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.69/1.21
% 1.69/1.21 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.69/1.21 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.69/1.21 ------ Proving...
% 1.69/1.21 ------ Problem Properties
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21 clauses 3
% 1.69/1.21 conjectures 3
% 1.69/1.21 EPR 3
% 1.69/1.21 Horn 3
% 1.69/1.21 unary 2
% 1.69/1.21 binary 1
% 1.69/1.21 lits 4
% 1.69/1.21 lits eq 0
% 1.69/1.21 fd_pure 0
% 1.69/1.21 fd_pseudo 0
% 1.69/1.21 fd_cond 0
% 1.69/1.21 fd_pseudo_cond 0
% 1.69/1.21 AC symbols 0
% 1.69/1.21
% 1.69/1.21 ------ Schedule EPR Horn non eq is on
% 1.69/1.21
% 1.69/1.21 ------ no equalities: superposition off
% 1.69/1.21
% 1.69/1.21 ------ Option_epr_horn Time Limit: Unbounded
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21 ------
% 1.69/1.21 Current options:
% 1.69/1.21 ------
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21 ------ Proving...
% 1.69/1.21
% 1.69/1.21
% 1.69/1.21 % SZS status Theorem for theBenchmark.p
% 1.69/1.21
% 1.69/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.21
% 1.69/1.21
%------------------------------------------------------------------------------