TSTP Solution File: SEU129+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU129+2 : 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 : Fri May 3 03:04:36 EDT 2024
% Result : Theorem 3.73s 1.13s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 27 ~; 18 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 58 ( 3 sgn 38 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f26,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f27,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f28,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f27]) ).
fof(f50,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f51,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f53,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ~ subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f88,plain,
( ? [X0,X1,X2] :
( ~ subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
& subset(X0,X1) )
=> ( ~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8))
& subset(sK6,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
( ~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8))
& subset(sK6,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f54,f88]) ).
fof(f96,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f129,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f130,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f132,plain,
! [X2,X0,X1] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f133,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f89]) ).
fof(f134,plain,
~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f89]) ).
cnf(c_51,plain,
set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f96]) ).
cnf(c_84,plain,
subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f129]) ).
cnf(c_85,plain,
( ~ subset(X0,X1)
| ~ subset(X0,X2)
| subset(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f130]) ).
cnf(c_87,plain,
( ~ subset(X0,X1)
| ~ subset(X2,X0)
| subset(X2,X1) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_88,negated_conjecture,
~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f134]) ).
cnf(c_89,negated_conjecture,
subset(sK6,sK7),
inference(cnf_transformation,[],[f133]) ).
cnf(c_524,plain,
~ subset(set_intersection2(sK6,sK8),set_intersection2(sK8,sK7)),
inference(demodulation,[status(thm)],[c_88,c_51]) ).
cnf(c_1219,negated_conjecture,
subset(sK6,sK7),
inference(demodulation,[status(thm)],[c_89]) ).
cnf(c_2069,plain,
subset(set_intersection2(X0,X1),X1),
inference(superposition,[status(thm)],[c_51,c_84]) ).
cnf(c_2627,plain,
( ~ subset(X0,sK6)
| subset(X0,sK7) ),
inference(superposition,[status(thm)],[c_1219,c_87]) ).
cnf(c_2694,plain,
subset(set_intersection2(sK6,X0),sK7),
inference(superposition,[status(thm)],[c_84,c_2627]) ).
cnf(c_3183,plain,
( ~ subset(set_intersection2(sK6,sK8),sK8)
| ~ subset(set_intersection2(sK6,sK8),sK7) ),
inference(superposition,[status(thm)],[c_85,c_524]) ).
cnf(c_3188,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3183,c_2694,c_2069]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU129+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 18:04:21 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 3.73/1.13 % SZS status Started for theBenchmark.p
% 3.73/1.13 % SZS status Theorem for theBenchmark.p
% 3.73/1.13
% 3.73/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.73/1.13
% 3.73/1.13 ------ iProver source info
% 3.73/1.13
% 3.73/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.73/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.73/1.13 git: non_committed_changes: false
% 3.73/1.13
% 3.73/1.13 ------ Parsing...
% 3.73/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.73/1.13
% 3.73/1.13 ------ 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
% 3.73/1.13
% 3.73/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.73/1.13
% 3.73/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.73/1.13 ------ Proving...
% 3.73/1.13 ------ Problem Properties
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13 clauses 52
% 3.73/1.13 conjectures 1
% 3.73/1.13 EPR 17
% 3.73/1.13 Horn 43
% 3.73/1.13 unary 16
% 3.73/1.13 binary 21
% 3.73/1.13 lits 105
% 3.73/1.13 lits eq 20
% 3.73/1.13 fd_pure 0
% 3.73/1.13 fd_pseudo 0
% 3.73/1.13 fd_cond 3
% 3.73/1.13 fd_pseudo_cond 8
% 3.73/1.13 AC symbols 0
% 3.73/1.13
% 3.73/1.13 ------ Schedule dynamic 5 is on
% 3.73/1.13
% 3.73/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13 ------
% 3.73/1.13 Current options:
% 3.73/1.13 ------
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13 ------ Proving...
% 3.73/1.13
% 3.73/1.13
% 3.73/1.13 % SZS status Theorem for theBenchmark.p
% 3.73/1.13
% 3.73/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.73/1.13
% 3.73/1.13
%------------------------------------------------------------------------------