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