TSTP Solution File: SEU121+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:03:49 EDT 2023
% Result : Theorem 1.20s 1.18s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 31 ~; 26 |; 20 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn; 30 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(negated_conjecture,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f21,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,[],[f15]) ).
fof(f22,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,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f24,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])],[f22,f23]) ).
fof(f29,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ subset(sK3,sK5)
& subset(sK4,sK5)
& subset(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
( ~ subset(sK3,sK5)
& subset(sK4,sK5)
& subset(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f17,f29]) ).
fof(f32,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f33,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f30]) ).
fof(f40,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f30]) ).
fof(f41,plain,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f30]) ).
cnf(c_50,plain,
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_51,plain,
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_52,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_57,negated_conjecture,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f41]) ).
cnf(c_58,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f40]) ).
cnf(c_59,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f39]) ).
cnf(c_445,plain,
( ~ subset(X0,X1)
| in(sK0(X0,X2),X1)
| subset(X0,X2) ),
inference(superposition,[status(thm)],[c_51,c_52]) ).
cnf(c_455,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X2)
| in(sK0(X0,X3),X2)
| subset(X0,X3) ),
inference(superposition,[status(thm)],[c_445,c_52]) ).
cnf(c_542,plain,
( ~ subset(X0,sK4)
| in(sK0(X0,X1),sK5)
| subset(X0,X1) ),
inference(superposition,[status(thm)],[c_58,c_455]) ).
cnf(c_568,plain,
( ~ subset(X0,sK4)
| subset(X0,sK5) ),
inference(superposition,[status(thm)],[c_542,c_50]) ).
cnf(c_590,plain,
subset(sK3,sK5),
inference(superposition,[status(thm)],[c_59,c_568]) ).
cnf(c_592,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_590,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Wed Aug 23 22:04:02 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.20/1.18 % SZS status Started for theBenchmark.p
% 1.20/1.18 % SZS status Theorem for theBenchmark.p
% 1.20/1.18
% 1.20/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.20/1.18
% 1.20/1.18 ------ iProver source info
% 1.20/1.18
% 1.20/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.20/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.20/1.18 git: non_committed_changes: false
% 1.20/1.18 git: last_make_outside_of_git: false
% 1.20/1.18
% 1.20/1.18 ------ Parsing...
% 1.20/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.20/1.18
% 1.20/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.20/1.18
% 1.20/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.20/1.18
% 1.20/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.20/1.18 ------ Proving...
% 1.20/1.18 ------ Problem Properties
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18 clauses 14
% 1.20/1.18 conjectures 3
% 1.20/1.18 EPR 12
% 1.20/1.18 Horn 13
% 1.20/1.18 unary 7
% 1.20/1.18 binary 5
% 1.20/1.18 lits 23
% 1.20/1.18 lits eq 2
% 1.20/1.18 fd_pure 0
% 1.20/1.18 fd_pseudo 0
% 1.20/1.18 fd_cond 1
% 1.20/1.18 fd_pseudo_cond 1
% 1.20/1.18 AC symbols 0
% 1.20/1.18
% 1.20/1.18 ------ Schedule dynamic 5 is on
% 1.20/1.18
% 1.20/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18 ------
% 1.20/1.18 Current options:
% 1.20/1.18 ------
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18 ------ Proving...
% 1.20/1.18
% 1.20/1.18
% 1.20/1.18 % SZS status Theorem for theBenchmark.p
% 1.20/1.18
% 1.20/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/1.18
% 1.20/1.18
%------------------------------------------------------------------------------