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