TSTP Solution File: SYN962+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN962+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:43 EDT 2024
% Result : Theorem 0.75s 1.19s
% Output : CNFRefutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 5 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 21 ( 2 sgn 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] : p(X0)
=> ( ! [X1] : p(X1)
& ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] : p(X0)
=> ( ! [X1] : p(X1)
& ! [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ! [X0] : p(X0)
=> ( ! [X1] : p(X1)
& ! [X2] : p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ? [X1] : ~ p(X1)
| ? [X2] : ~ p(X2) )
& ! [X0] : p(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X0] : ~ p(X0)
| ? [X1] : ~ p(X1) )
& ! [X2] : p(X2) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0] : ~ p(X0)
=> ~ p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X1] : ~ p(X1)
=> ~ p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ( ~ p(sK0)
| ~ p(sK1) )
& ! [X2] : p(X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f9,plain,
! [X2] : p(X2),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
( ~ p(sK0)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ p(sK0)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
p(X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_51,plain,
p(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_52,negated_conjecture,
~ p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_51,c_49]) ).
cnf(c_54,negated_conjecture,
~ p(sK1),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_55,negated_conjecture,
p(X0),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_56,plain,
$false,
inference(resolution,[status(thm)],[c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN962+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:44:25 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 0.75/1.19 % SZS status Started for theBenchmark.p
% 0.75/1.19 % SZS status Theorem for theBenchmark.p
% 0.75/1.19
% 0.75/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.75/1.19
% 0.75/1.19 ------ iProver source info
% 0.75/1.19
% 0.75/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.75/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.75/1.19 git: non_committed_changes: false
% 0.75/1.19
% 0.75/1.19 ------ Parsing...
% 0.75/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.75/1.19
% 0.75/1.19 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.75/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.75/1.19 ------ Proving...
% 0.75/1.19 ------ Problem Properties
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19 clauses 2
% 0.75/1.19 conjectures 2
% 0.75/1.19 EPR 2
% 0.75/1.19 Horn 2
% 0.75/1.19 unary 2
% 0.75/1.19 binary 0
% 0.75/1.19 lits 2
% 0.75/1.19 lits eq 0
% 0.75/1.19 fd_pure 0
% 0.75/1.19 fd_pseudo 0
% 0.75/1.19 fd_cond 0
% 0.75/1.19 fd_pseudo_cond 0
% 0.75/1.19 AC symbols 0
% 0.75/1.19
% 0.75/1.19 ------ Schedule EPR Horn non eq is on
% 0.75/1.19
% 0.75/1.19 ------ no equalities: superposition off
% 0.75/1.19
% 0.75/1.19 ------ Option_epr_horn Time Limit: Unbounded
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19 ------
% 0.75/1.19 Current options:
% 0.75/1.19 ------
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19 ------ Proving...
% 0.75/1.19
% 0.75/1.19
% 0.75/1.19 % SZS status Theorem for theBenchmark.p
% 0.75/1.19
% 0.75/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.75/1.19
% 0.75/1.19
%------------------------------------------------------------------------------