TSTP Solution File: SEU062+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU062+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:04:26 EDT 2024
% Result : Theorem 2.53s 1.20s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f25,axiom,
! [X0,X1] :
( relation(X1)
=> ( in(X0,relation_rng(X1))
<=> empty_set != relation_inverse_image(X1,singleton(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t142_funct_1) ).
fof(f26,conjecture,
! [X0,X1] :
( relation(X1)
=> ( ! [X2] :
~ ( empty_set = relation_inverse_image(X1,singleton(X2))
& in(X2,X0) )
=> subset(X0,relation_rng(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t143_funct_1) ).
fof(f27,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( ! [X2] :
~ ( empty_set = relation_inverse_image(X1,singleton(X2))
& in(X2,X0) )
=> subset(X0,relation_rng(X1)) ) ),
inference(negated_conjecture,[],[f26]) ).
fof(f46,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f51,plain,
! [X0,X1] :
( ( in(X0,relation_rng(X1))
<=> empty_set != relation_inverse_image(X1,singleton(X0)) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f52,plain,
? [X0,X1] :
( ~ subset(X0,relation_rng(X1))
& ! [X2] :
( empty_set != relation_inverse_image(X1,singleton(X2))
| ~ in(X2,X0) )
& relation(X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f53,plain,
? [X0,X1] :
( ~ subset(X0,relation_rng(X1))
& ! [X2] :
( empty_set != relation_inverse_image(X1,singleton(X2))
| ~ in(X2,X0) )
& relation(X1) ),
inference(flattening,[],[f52]) ).
fof(f63,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f64,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f66,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f64,f65]) ).
fof(f89,plain,
! [X0,X1] :
( ( ( in(X0,relation_rng(X1))
| empty_set = relation_inverse_image(X1,singleton(X0)) )
& ( empty_set != relation_inverse_image(X1,singleton(X0))
| ~ in(X0,relation_rng(X1)) ) )
| ~ relation(X1) ),
inference(nnf_transformation,[],[f51]) ).
fof(f90,plain,
( ? [X0,X1] :
( ~ subset(X0,relation_rng(X1))
& ! [X2] :
( empty_set != relation_inverse_image(X1,singleton(X2))
| ~ in(X2,X0) )
& relation(X1) )
=> ( ~ subset(sK12,relation_rng(sK13))
& ! [X2] :
( empty_set != relation_inverse_image(sK13,singleton(X2))
| ~ in(X2,sK12) )
& relation(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
( ~ subset(sK12,relation_rng(sK13))
& ! [X2] :
( empty_set != relation_inverse_image(sK13,singleton(X2))
| ~ in(X2,sK12) )
& relation(sK13) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f53,f90]) ).
fof(f99,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f100,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f132,plain,
! [X0,X1] :
( in(X0,relation_rng(X1))
| empty_set = relation_inverse_image(X1,singleton(X0))
| ~ relation(X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f133,plain,
relation(sK13),
inference(cnf_transformation,[],[f91]) ).
fof(f134,plain,
! [X2] :
( empty_set != relation_inverse_image(sK13,singleton(X2))
| ~ in(X2,sK12) ),
inference(cnf_transformation,[],[f91]) ).
fof(f135,plain,
~ subset(sK12,relation_rng(sK13)),
inference(cnf_transformation,[],[f91]) ).
cnf(c_52,plain,
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
cnf(c_53,plain,
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_85,plain,
( ~ relation(X0)
| relation_inverse_image(X0,singleton(X1)) = empty_set
| in(X1,relation_rng(X0)) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_87,negated_conjecture,
~ subset(sK12,relation_rng(sK13)),
inference(cnf_transformation,[],[f135]) ).
cnf(c_88,negated_conjecture,
( relation_inverse_image(sK13,singleton(X0)) != empty_set
| ~ in(X0,sK12) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_89,negated_conjecture,
relation(sK13),
inference(cnf_transformation,[],[f133]) ).
cnf(c_2025,plain,
relation_rng(sK13) = sP0_iProver_def,
definition ).
cnf(c_2026,negated_conjecture,
relation(sK13),
inference(demodulation,[status(thm)],[c_89]) ).
cnf(c_2027,negated_conjecture,
( relation_inverse_image(sK13,singleton(X0)) != empty_set
| ~ in(X0,sK12) ),
inference(demodulation,[status(thm)],[c_88]) ).
cnf(c_2028,negated_conjecture,
~ subset(sK12,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_87,c_2025]) ).
cnf(c_2933,plain,
( ~ relation(sK13)
| relation_inverse_image(sK13,singleton(X0)) = empty_set
| in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_2025,c_85]) ).
cnf(c_2943,plain,
( relation_inverse_image(sK13,singleton(X0)) = empty_set
| in(X0,sP0_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2933,c_2026]) ).
cnf(c_3018,plain,
( relation_inverse_image(sK13,singleton(sK0(X0,sP0_iProver_def))) = empty_set
| subset(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_2943,c_52]) ).
cnf(c_3067,plain,
relation_inverse_image(sK13,singleton(sK0(sK12,sP0_iProver_def))) = empty_set,
inference(superposition,[status(thm)],[c_3018,c_2028]) ).
cnf(c_3073,plain,
~ in(sK0(sK12,sP0_iProver_def),sK12),
inference(superposition,[status(thm)],[c_3067,c_2027]) ).
cnf(c_3078,plain,
subset(sK12,sP0_iProver_def),
inference(superposition,[status(thm)],[c_53,c_3073]) ).
cnf(c_3079,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3078,c_2028]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU062+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n013.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 : Thu May 2 17:42:04 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.53/1.20 % SZS status Started for theBenchmark.p
% 2.53/1.20 % SZS status Theorem for theBenchmark.p
% 2.53/1.20
% 2.53/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.53/1.20
% 2.53/1.20 ------ iProver source info
% 2.53/1.20
% 2.53/1.20 git: date: 2024-05-02 19:28:25 +0000
% 2.53/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.53/1.20 git: non_committed_changes: false
% 2.53/1.20
% 2.53/1.20 ------ Parsing...
% 2.53/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.53/1.20
% 2.53/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 2.53/1.20
% 2.53/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.53/1.20
% 2.53/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.53/1.20 ------ Proving...
% 2.53/1.20 ------ Problem Properties
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20 clauses 44
% 2.53/1.20 conjectures 3
% 2.53/1.20 EPR 26
% 2.53/1.20 Horn 40
% 2.53/1.20 unary 22
% 2.53/1.20 binary 14
% 2.53/1.20 lits 74
% 2.53/1.20 lits eq 6
% 2.53/1.20 fd_pure 0
% 2.53/1.20 fd_pseudo 0
% 2.53/1.20 fd_cond 1
% 2.53/1.20 fd_pseudo_cond 1
% 2.53/1.20 AC symbols 0
% 2.53/1.20
% 2.53/1.20 ------ Schedule dynamic 5 is on
% 2.53/1.20
% 2.53/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20 ------
% 2.53/1.20 Current options:
% 2.53/1.20 ------
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20 ------ Proving...
% 2.53/1.20
% 2.53/1.20
% 2.53/1.20 % SZS status Theorem for theBenchmark.p
% 2.53/1.20
% 2.53/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.53/1.21
% 2.53/1.21
%------------------------------------------------------------------------------