TSTP Solution File: SET639+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:08:51 EDT 2023
% Result : Theorem 1.84s 1.14s
% Output : CNFRefutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 42 ( 28 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 30 ( 11 ~; 3 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 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; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f10,conjecture,
! [X0,X1] :
( ( empty_set = intersection(X1,X0)
& subset(X0,X1) )
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th121) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] :
( ( empty_set = intersection(X1,X0)
& subset(X0,X1) )
=> empty_set = X0 ),
inference(negated_conjecture,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
? [X0,X1] :
( empty_set != X0
& empty_set = intersection(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f15,plain,
? [X0,X1] :
( empty_set != X0
& empty_set = intersection(X1,X0)
& subset(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f28,plain,
( ? [X0,X1] :
( empty_set != X0
& empty_set = intersection(X1,X0)
& subset(X0,X1) )
=> ( empty_set != sK2
& empty_set = intersection(sK3,sK2)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( empty_set != sK2
& empty_set = intersection(sK3,sK2)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f28]) ).
fof(f30,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f41,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f47,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
empty_set = intersection(sK3,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f29]) ).
cnf(c_49,plain,
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_60,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f41]) ).
cnf(c_64,negated_conjecture,
empty_set != sK2,
inference(cnf_transformation,[],[f49]) ).
cnf(c_65,negated_conjecture,
intersection(sK3,sK2) = empty_set,
inference(cnf_transformation,[],[f48]) ).
cnf(c_66,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f47]) ).
cnf(c_137,plain,
intersection(sK2,sK3) = empty_set,
inference(demodulation,[status(thm)],[c_65,c_60]) ).
cnf(c_510,plain,
intersection(sK2,sK3) = sK2,
inference(superposition,[status(thm)],[c_66,c_49]) ).
cnf(c_512,plain,
empty_set = sK2,
inference(light_normalisation,[status(thm)],[c_510,c_137]) ).
cnf(c_513,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_512,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.14/0.14 % Command : run_iprover %s %d THM
% 0.14/0.33 % Computer : n004.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sat Aug 26 09:09:38 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.84/1.14 % SZS status Started for theBenchmark.p
% 1.84/1.14 % SZS status Theorem for theBenchmark.p
% 1.84/1.14
% 1.84/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.84/1.14
% 1.84/1.14 ------ iProver source info
% 1.84/1.14
% 1.84/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.84/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.84/1.14 git: non_committed_changes: false
% 1.84/1.14 git: last_make_outside_of_git: false
% 1.84/1.14
% 1.84/1.14 ------ Parsing...
% 1.84/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.84/1.14
% 1.84/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.84/1.14
% 1.84/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.84/1.14
% 1.84/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.84/1.14 ------ Proving...
% 1.84/1.14 ------ Problem Properties
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14 clauses 16
% 1.84/1.14 conjectures 2
% 1.84/1.14 EPR 6
% 1.84/1.14 Horn 14
% 1.84/1.14 unary 6
% 1.84/1.14 binary 5
% 1.84/1.14 lits 31
% 1.84/1.14 lits eq 7
% 1.84/1.14 fd_pure 0
% 1.84/1.14 fd_pseudo 0
% 1.84/1.14 fd_cond 0
% 1.84/1.14 fd_pseudo_cond 3
% 1.84/1.14 AC symbols 0
% 1.84/1.14
% 1.84/1.14 ------ Schedule dynamic 5 is on
% 1.84/1.14
% 1.84/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14 ------
% 1.84/1.14 Current options:
% 1.84/1.14 ------
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14 ------ Proving...
% 1.84/1.14
% 1.84/1.14
% 1.84/1.14 % SZS status Theorem for theBenchmark.p
% 1.84/1.14
% 1.84/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.84/1.14
% 1.84/1.14
%------------------------------------------------------------------------------