TSTP Solution File: SEU189+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 : Thu Aug 31 17:04:31 EDT 2023
% Result : Theorem 1.10s 1.16s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 91 ( 73 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 97 ( 40 ~; 35 |; 14 &)
% ( 2 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn; 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f23,conjecture,
! [X0] :
( relation(X0)
=> ( relation_dom(X0) = empty_set
<=> relation_rng(X0) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_relat_1) ).
fof(f24,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( relation_dom(X0) = empty_set
<=> relation_rng(X0) = empty_set ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f25,axiom,
( empty_set = relation_rng(empty_set)
& empty_set = relation_dom(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_relat_1) ).
fof(f26,axiom,
! [X0] :
( relation(X0)
=> ( ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
=> empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t64_relat_1) ).
fof(f41,plain,
? [X0] :
( ( relation_dom(X0) = empty_set
<~> relation_rng(X0) = empty_set )
& relation(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f42,plain,
! [X0] :
( empty_set = X0
| ( relation_rng(X0) != empty_set
& relation_dom(X0) != empty_set )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f43,plain,
! [X0] :
( empty_set = X0
| ( relation_rng(X0) != empty_set
& relation_dom(X0) != empty_set )
| ~ relation(X0) ),
inference(flattening,[],[f42]) ).
fof(f54,plain,
? [X0] :
( ( relation_rng(X0) != empty_set
| relation_dom(X0) != empty_set )
& ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
& relation(X0) ),
inference(nnf_transformation,[],[f41]) ).
fof(f55,plain,
? [X0] :
( ( relation_rng(X0) != empty_set
| relation_dom(X0) != empty_set )
& ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
& relation(X0) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ? [X0] :
( ( relation_rng(X0) != empty_set
| relation_dom(X0) != empty_set )
& ( relation_rng(X0) = empty_set
| relation_dom(X0) = empty_set )
& relation(X0) )
=> ( ( empty_set != relation_rng(sK5)
| empty_set != relation_dom(sK5) )
& ( empty_set = relation_rng(sK5)
| empty_set = relation_dom(sK5) )
& relation(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
( ( empty_set != relation_rng(sK5)
| empty_set != relation_dom(sK5) )
& ( empty_set = relation_rng(sK5)
| empty_set = relation_dom(sK5) )
& relation(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f55,f56]) ).
fof(f81,plain,
relation(sK5),
inference(cnf_transformation,[],[f57]) ).
fof(f82,plain,
( empty_set = relation_rng(sK5)
| empty_set = relation_dom(sK5) ),
inference(cnf_transformation,[],[f57]) ).
fof(f83,plain,
( empty_set != relation_rng(sK5)
| empty_set != relation_dom(sK5) ),
inference(cnf_transformation,[],[f57]) ).
fof(f84,plain,
empty_set = relation_dom(empty_set),
inference(cnf_transformation,[],[f25]) ).
fof(f85,plain,
empty_set = relation_rng(empty_set),
inference(cnf_transformation,[],[f25]) ).
fof(f86,plain,
! [X0] :
( empty_set = X0
| relation_dom(X0) != empty_set
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f87,plain,
! [X0] :
( empty_set = X0
| relation_rng(X0) != empty_set
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_72,negated_conjecture,
( relation_dom(sK5) != empty_set
| relation_rng(sK5) != empty_set ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_73,negated_conjecture,
( relation_dom(sK5) = empty_set
| relation_rng(sK5) = empty_set ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_74,negated_conjecture,
relation(sK5),
inference(cnf_transformation,[],[f81]) ).
cnf(c_75,plain,
relation_rng(empty_set) = empty_set,
inference(cnf_transformation,[],[f85]) ).
cnf(c_76,plain,
relation_dom(empty_set) = empty_set,
inference(cnf_transformation,[],[f84]) ).
cnf(c_77,plain,
( relation_rng(X0) != empty_set
| ~ relation(X0)
| X0 = empty_set ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_78,plain,
( relation_dom(X0) != empty_set
| ~ relation(X0)
| X0 = empty_set ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_489,plain,
( relation_dom(X0) != empty_set
| X0 != sK5
| X0 = empty_set ),
inference(resolution_lifted,[status(thm)],[c_78,c_74]) ).
cnf(c_490,plain,
( relation_dom(sK5) != empty_set
| sK5 = empty_set ),
inference(unflattening,[status(thm)],[c_489]) ).
cnf(c_497,plain,
( relation_rng(X0) != empty_set
| X0 != sK5
| X0 = empty_set ),
inference(resolution_lifted,[status(thm)],[c_77,c_74]) ).
cnf(c_498,plain,
( relation_rng(sK5) != empty_set
| sK5 = empty_set ),
inference(unflattening,[status(thm)],[c_497]) ).
cnf(c_499,plain,
sK5 = empty_set,
inference(global_subsumption_just,[status(thm)],[c_498,c_73,c_490,c_498]) ).
cnf(c_547,plain,
( relation_rng(sK5) != empty_set
| relation_dom(sK5) != empty_set ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
cnf(c_548,plain,
( relation_dom(sK5) != empty_set
| relation_rng(sK5) != empty_set ),
inference(renaming,[status(thm)],[c_547]) ).
cnf(c_793,plain,
empty_set != empty_set,
inference(light_normalisation,[status(thm)],[c_548,c_75,c_76,c_499]) ).
cnf(c_794,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_793]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 24 00:44:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.10/1.16 % SZS status Started for theBenchmark.p
% 1.10/1.16 % SZS status Theorem for theBenchmark.p
% 1.10/1.16
% 1.10/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.10/1.16
% 1.10/1.16 ------ iProver source info
% 1.10/1.16
% 1.10/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.10/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.10/1.16 git: non_committed_changes: false
% 1.10/1.16 git: last_make_outside_of_git: false
% 1.10/1.16
% 1.10/1.16 ------ Parsing...
% 1.10/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.10/1.16
% 1.10/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 1.10/1.16
% 1.10/1.16 % SZS status Theorem for theBenchmark.p
% 1.10/1.16
% 1.10/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.10/1.17
% 1.10/1.17
%------------------------------------------------------------------------------