TSTP Solution File: SYN372+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN372+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:06:44 EDT 2023
% Result : Theorem 0.72s 1.16s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 50 ( 20 ~; 9 |; 10 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 26 ( 2 sgn; 10 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ? [X1] :
( big_p(X1)
=> big_q(X0) )
=> ? [X1] :
( big_p(X1)
=> big_q(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2123) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ? [X1] :
( big_p(X1)
=> big_q(X0) )
=> ? [X1] :
( big_p(X1)
=> big_q(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ! [X0] :
( ? [X1] :
( big_p(X1)
=> big_q(X0) )
=> ? [X2] :
( big_p(X2)
=> big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ! [X2] :
( ~ big_q(X2)
& big_p(X2) )
& ? [X1] :
( big_q(X0)
| ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ! [X1] :
( ~ big_q(X1)
& big_p(X1) )
& ? [X2] :
( big_q(X0)
| ~ big_p(X2) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1] :
( ~ big_q(X1)
& big_p(X1) )
& ? [X2] :
( big_q(X0)
| ~ big_p(X2) ) )
=> ( ! [X1] :
( ~ big_q(X1)
& big_p(X1) )
& ? [X2] :
( big_q(sK0)
| ~ big_p(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X2] :
( big_q(sK0)
| ~ big_p(X2) )
=> ( big_q(sK0)
| ~ big_p(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ! [X1] :
( ~ big_q(X1)
& big_p(X1) )
& ( big_q(sK0)
| ~ big_p(sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f9,plain,
( big_q(sK0)
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X1] : big_p(X1),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X1] : ~ big_q(X1),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
~ big_q(X0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,negated_conjecture,
big_p(X0),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,negated_conjecture,
( ~ big_p(sK1)
| big_q(sK0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_53,plain,
~ big_q(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_54,negated_conjecture,
~ big_p(sK1),
inference(global_subsumption_just,[status(thm)],[c_51,c_53,c_51]) ).
cnf(c_56,plain,
$false,
inference(resolution,[status(thm)],[c_54,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN372+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 19:08:35 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.72/1.16 % SZS status Started for theBenchmark.p
% 0.72/1.16 % SZS status Theorem for theBenchmark.p
% 0.72/1.16
% 0.72/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.72/1.16
% 0.72/1.16 ------ iProver source info
% 0.72/1.16
% 0.72/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.72/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.72/1.16 git: non_committed_changes: false
% 0.72/1.16 git: last_make_outside_of_git: false
% 0.72/1.16
% 0.72/1.16 ------ Parsing...
% 0.72/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.72/1.16
% 0.72/1.16 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.72/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.72/1.16 ------ Proving...
% 0.72/1.16 ------ Problem Properties
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 clauses 2
% 0.72/1.16 conjectures 2
% 0.72/1.16 EPR 2
% 0.72/1.16 Horn 2
% 0.72/1.16 unary 2
% 0.72/1.16 binary 0
% 0.72/1.16 lits 2
% 0.72/1.16 lits eq 0
% 0.72/1.16 fd_pure 0
% 0.72/1.16 fd_pseudo 0
% 0.72/1.16 fd_cond 0
% 0.72/1.16 fd_pseudo_cond 0
% 0.72/1.16 AC symbols 0
% 0.72/1.16
% 0.72/1.16 ------ Schedule EPR Horn non eq is on
% 0.72/1.16
% 0.72/1.16 ------ no equalities: superposition off
% 0.72/1.16
% 0.72/1.16 ------ Option_epr_horn Time Limit: Unbounded
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 ------
% 0.72/1.16 Current options:
% 0.72/1.16 ------
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 ------ Proving...
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 % SZS status Theorem for theBenchmark.p
% 0.72/1.16
% 0.72/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.72/1.16
% 0.72/1.16
%------------------------------------------------------------------------------