TSTP Solution File: SYN358+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN358+1 : TPTP v8.1.2. Released v2.0.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:30:17 EDT 2024
% Result : Theorem 1.53s 1.23s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f16)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X0] : big_q(X0)
& p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2109) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X0] : big_q(X0)
& p ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
( big_q(X0)
& p )
<=> ( ? [X1] : big_q(X1)
& p ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( big_q(X0)
& p )
<~> ( ? [X1] : big_q(X1)
& p ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X1] : ~ big_q(X1)
| ~ p
| ! [X0] :
( ~ big_q(X0)
| ~ p ) )
& ( ( ? [X1] : big_q(X1)
& p )
| ? [X0] :
( big_q(X0)
& p ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X1] : ~ big_q(X1)
| ~ p
| ! [X0] :
( ~ big_q(X0)
| ~ p ) )
& ( ( ? [X1] : big_q(X1)
& p )
| ? [X0] :
( big_q(X0)
& p ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ! [X0] : ~ big_q(X0)
| ~ p
| ! [X1] :
( ~ big_q(X1)
| ~ p ) )
& ( ( ? [X2] : big_q(X2)
& p )
| ? [X3] :
( big_q(X3)
& p ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ? [X2] : big_q(X2)
=> big_q(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X3] :
( big_q(X3)
& p )
=> ( big_q(sK1)
& p ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ( ! [X0] : ~ big_q(X0)
| ~ p
| ! [X1] :
( ~ big_q(X1)
| ~ p ) )
& ( ( big_q(sK0)
& p )
| ( big_q(sK1)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f14,plain,
( big_q(sK0)
| big_q(sK1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_49,negated_conjecture,
( ~ big_q(X0)
| ~ big_q(X1)
| ~ p ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,negated_conjecture,
( big_q(sK0)
| big_q(sK1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_53,negated_conjecture,
p,
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,plain,
( ~ big_q(sK0)
| ~ p ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_59,negated_conjecture,
big_q(sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_53,c_50,c_54]) ).
cnf(c_61,plain,
( ~ big_q(X1)
| ~ big_q(X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_53,c_49]) ).
cnf(c_62,negated_conjecture,
( ~ big_q(X0)
| ~ big_q(X1) ),
inference(renaming,[status(thm)],[c_61]) ).
cnf(c_78,negated_conjecture,
( ~ big_q(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_62]) ).
cnf(c_79,negated_conjecture,
sP0_iProver_def,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_62]) ).
cnf(c_80,negated_conjecture,
sP0_iProver_def,
inference(demodulation,[status(thm)],[c_79]) ).
cnf(c_82,negated_conjecture,
( ~ big_q(X0)
| ~ sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_78]) ).
cnf(c_83,negated_conjecture,
big_q(sK1),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_86,negated_conjecture,
~ big_q(X0),
inference(global_subsumption_just,[status(thm)],[c_82,c_80,c_82]) ).
cnf(c_88,plain,
$false,
inference(resolution,[status(thm)],[c_86,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SYN358+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.16 % 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:13:27 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.53/1.23 % SZS status Started for theBenchmark.p
% 1.53/1.23 % SZS status Theorem for theBenchmark.p
% 1.53/1.23
% 1.53/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.53/1.23
% 1.53/1.23 ------ iProver source info
% 1.53/1.23
% 1.53/1.23 git: date: 2024-05-02 19:28:25 +0000
% 1.53/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.53/1.23 git: non_committed_changes: false
% 1.53/1.23
% 1.53/1.23 ------ Parsing...
% 1.53/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.53/1.23
% 1.53/1.23 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.53/1.23 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.53/1.23 ------ Proving...
% 1.53/1.23 ------ Problem Properties
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23 clauses 3
% 1.53/1.23 conjectures 3
% 1.53/1.23 EPR 3
% 1.53/1.23 Horn 3
% 1.53/1.23 unary 2
% 1.53/1.23 binary 1
% 1.53/1.23 lits 4
% 1.53/1.23 lits eq 0
% 1.53/1.23 fd_pure 0
% 1.53/1.23 fd_pseudo 0
% 1.53/1.23 fd_cond 0
% 1.53/1.23 fd_pseudo_cond 0
% 1.53/1.23 AC symbols 0
% 1.53/1.23
% 1.53/1.23 ------ Schedule EPR Horn non eq is on
% 1.53/1.23
% 1.53/1.23 ------ no equalities: superposition off
% 1.53/1.23
% 1.53/1.23 ------ Option_epr_horn Time Limit: Unbounded
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23 ------
% 1.53/1.23 Current options:
% 1.53/1.23 ------
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23 ------ Proving...
% 1.53/1.23
% 1.53/1.23
% 1.53/1.23 % SZS status Theorem for theBenchmark.p
% 1.53/1.23
% 1.53/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.53/1.23
% 1.53/1.23
%------------------------------------------------------------------------------