TSTP Solution File: SET899+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 15:10:32 EDT 2023
% Result : Theorem 1.51s 1.15s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 13 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 18 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(f10,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0)
& subset(X0,X1) )
=> ( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& ~ in(sK4,sK2)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& ~ in(sK4,sK2)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f18]) ).
fof(f24,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f25,plain,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X2,X0,X1] :
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,plain,
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_100,plain,
( ~ subset(sK2,sK3)
| subset(sK2,set_difference(sK3,singleton(sK4)))
| in(sK4,sK2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_101,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_100,c_53,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 10:14:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.51/1.15 % SZS status Started for theBenchmark.p
% 1.51/1.15 % SZS status Theorem for theBenchmark.p
% 1.51/1.15
% 1.51/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.51/1.15
% 1.51/1.15 ------ iProver source info
% 1.51/1.15
% 1.51/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.51/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.51/1.15 git: non_committed_changes: false
% 1.51/1.15 git: last_make_outside_of_git: false
% 1.51/1.15
% 1.51/1.15 ------ Parsing...
% 1.51/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.51/1.15
% 1.51/1.15 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.51/1.15
% 1.51/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.51/1.15 ------ Proving...
% 1.51/1.15 ------ Problem Properties
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15 clauses 6
% 1.51/1.15 conjectures 3
% 1.51/1.15 EPR 4
% 1.51/1.15 Horn 5
% 1.51/1.15 unary 4
% 1.51/1.15 binary 1
% 1.51/1.15 lits 9
% 1.51/1.15 lits eq 0
% 1.51/1.15 fd_pure 0
% 1.51/1.15 fd_pseudo 0
% 1.51/1.15 fd_cond 0
% 1.51/1.15 fd_pseudo_cond 0
% 1.51/1.15 AC symbols 0
% 1.51/1.15
% 1.51/1.15 ------ Schedule dynamic 5 is on
% 1.51/1.15
% 1.51/1.15 ------ no equalities: superposition off
% 1.51/1.15
% 1.51/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15 ------
% 1.51/1.15 Current options:
% 1.51/1.15 ------
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15 ------ Proving...
% 1.51/1.15
% 1.51/1.15
% 1.51/1.15 % SZS status Theorem for theBenchmark.p
% 1.51/1.15
% 1.51/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.51/1.15
% 1.51/1.15
%------------------------------------------------------------------------------