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