TSTP Solution File: SET912+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:01:58 EDT 2024
% Result : Theorem 2.15s 1.22s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 65 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 64 ( 25 ~; 17 |; 17 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f9,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f10,conjecture,
! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t53_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ),
inference(negated_conjecture,[],[f10]) ).
fof(f15,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f16,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
( ? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) )
=> ( unordered_pair(sK2,sK4) != set_intersection2(unordered_pair(sK2,sK4),sK3)
& in(sK4,sK3)
& in(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( unordered_pair(sK2,sK4) != set_intersection2(unordered_pair(sK2,sK4),sK3)
& in(sK4,sK3)
& in(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f17,f24]) ).
fof(f33,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f36,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f37,plain,
in(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
in(sK4,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
unordered_pair(sK2,sK4) != set_intersection2(unordered_pair(sK2,sK4),sK3),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,plain,
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_57,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| subset(unordered_pair(X2,X0),X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_60,negated_conjecture,
set_intersection2(unordered_pair(sK2,sK4),sK3) != unordered_pair(sK2,sK4),
inference(cnf_transformation,[],[f39]) ).
cnf(c_61,negated_conjecture,
in(sK4,sK3),
inference(cnf_transformation,[],[f38]) ).
cnf(c_62,negated_conjecture,
in(sK2,sK3),
inference(cnf_transformation,[],[f37]) ).
cnf(c_338,negated_conjecture,
in(sK4,sK3),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_536,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| set_intersection2(unordered_pair(X2,X0),X1) = unordered_pair(X2,X0) ),
inference(superposition,[status(thm)],[c_57,c_56]) ).
cnf(c_548,plain,
( ~ in(X0,sK3)
| set_intersection2(unordered_pair(X0,sK4),sK3) = unordered_pair(X0,sK4) ),
inference(superposition,[status(thm)],[c_338,c_536]) ).
cnf(c_561,plain,
( ~ in(sK2,sK3)
| set_intersection2(unordered_pair(sK2,sK4),sK3) = unordered_pair(sK2,sK4) ),
inference(instantiation,[status(thm)],[c_548]) ).
cnf(c_562,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_561,c_60,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Thu May 2 20:28:05 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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
% 2.15/1.22 % SZS status Started for theBenchmark.p
% 2.15/1.22 % SZS status Theorem for theBenchmark.p
% 2.15/1.22
% 2.15/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.15/1.22
% 2.15/1.22 ------ iProver source info
% 2.15/1.22
% 2.15/1.22 git: date: 2024-05-02 19:28:25 +0000
% 2.15/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.15/1.22 git: non_committed_changes: false
% 2.15/1.22
% 2.15/1.22 ------ Parsing...
% 2.15/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.15/1.22
% 2.15/1.22 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 2.15/1.22
% 2.15/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.15/1.22
% 2.15/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.15/1.22 ------ Proving...
% 2.15/1.22 ------ Problem Properties
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22 clauses 13
% 2.15/1.22 conjectures 2
% 2.15/1.22 EPR 5
% 2.15/1.22 Horn 13
% 2.15/1.22 unary 8
% 2.15/1.22 binary 4
% 2.15/1.22 lits 19
% 2.15/1.22 lits eq 6
% 2.15/1.22 fd_pure 0
% 2.15/1.22 fd_pseudo 0
% 2.15/1.22 fd_cond 0
% 2.15/1.22 fd_pseudo_cond 0
% 2.15/1.22 AC symbols 0
% 2.15/1.22
% 2.15/1.22 ------ Schedule dynamic 5 is on
% 2.15/1.22
% 2.15/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22 ------
% 2.15/1.22 Current options:
% 2.15/1.22 ------
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22 ------ Proving...
% 2.15/1.22
% 2.15/1.22
% 2.15/1.22 % SZS status Theorem for theBenchmark.p
% 2.15/1.22
% 2.15/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.15/1.22
% 2.15/1.22
%------------------------------------------------------------------------------