TSTP Solution File: SET900+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET900+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:57 EDT 2024
% Result : Theorem 0.43s 1.12s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1] :
~ ( ! [X2] :
~ ( X1 != X2
& in(X2,X0) )
& empty_set != X0
& singleton(X1) != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
~ ( ! [X2] :
~ ( X1 != X2
& in(X2,X0) )
& empty_set != X0
& singleton(X1) != X0 ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] :
~ ( ! [X2] :
~ ( X1 != X2
& in(X2,X0) )
& empty_set != X0
& singleton(X1) != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l45_zfmisc_1) ).
fof(f9,plain,
? [X0,X1] :
( ! [X2] :
( X1 = X2
| ~ in(X2,X0) )
& empty_set != X0
& singleton(X1) != X0 ),
inference(ennf_transformation,[],[f6]) ).
fof(f10,plain,
! [X0,X1] :
( ? [X2] :
( X1 != X2
& in(X2,X0) )
| empty_set = X0
| singleton(X1) = X0 ),
inference(ennf_transformation,[],[f7]) ).
fof(f15,plain,
( ? [X0,X1] :
( ! [X2] :
( X1 = X2
| ~ in(X2,X0) )
& empty_set != X0
& singleton(X1) != X0 )
=> ( ! [X2] :
( sK3 = X2
| ~ in(X2,sK2) )
& empty_set != sK2
& sK2 != singleton(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ! [X2] :
( sK3 = X2
| ~ in(X2,sK2) )
& empty_set != sK2
& sK2 != singleton(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f9,f15]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X2] :
( X1 != X2
& in(X2,X0) )
=> ( sK4(X0,X1) != X1
& in(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( sK4(X0,X1) != X1
& in(sK4(X0,X1),X0) )
| empty_set = X0
| singleton(X1) = X0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f10,f17]) ).
fof(f23,plain,
sK2 != singleton(sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X2] :
( sK3 = X2
| ~ in(X2,sK2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| empty_set = X0
| singleton(X1) = X0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X0,X1] :
( sK4(X0,X1) != X1
| empty_set = X0
| singleton(X1) = X0 ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_53,negated_conjecture,
( ~ in(X0,sK2)
| X0 = sK3 ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_54,negated_conjecture,
empty_set != sK2,
inference(cnf_transformation,[],[f24]) ).
cnf(c_55,negated_conjecture,
singleton(sK3) != sK2,
inference(cnf_transformation,[],[f23]) ).
cnf(c_56,plain,
( sK4(X0,X1) != X1
| singleton(X1) = X0
| X0 = empty_set ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_57,plain,
( singleton(X0) = X1
| X1 = empty_set
| in(sK4(X1,X0),X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_126,plain,
singleton(sK3) = sP0_iProver_def,
definition ).
cnf(c_127,negated_conjecture,
sP0_iProver_def != sK2,
inference(demodulation,[status(thm)],[c_55,c_126]) ).
cnf(c_128,negated_conjecture,
empty_set != sK2,
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_129,negated_conjecture,
( ~ in(X0,sK2)
| X0 = sK3 ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_276,plain,
( sK4(sK2,X0) = sK3
| singleton(X0) = sK2
| empty_set = sK2 ),
inference(superposition,[status(thm)],[c_57,c_129]) ).
cnf(c_277,plain,
( sK4(sK2,X0) = sK3
| singleton(X0) = sK2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_276,c_128]) ).
cnf(c_289,plain,
( X0 != sK3
| singleton(X0) = sK2
| empty_set = sK2 ),
inference(superposition,[status(thm)],[c_277,c_56]) ).
cnf(c_293,plain,
( X0 != sK3
| singleton(X0) = sK2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_289,c_128]) ).
cnf(c_315,plain,
singleton(sK3) = sK2,
inference(equality_resolution,[status(thm)],[c_293]) ).
cnf(c_316,plain,
sK2 = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_315,c_126]) ).
cnf(c_323,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_127,c_316]) ).
cnf(c_324,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET900+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 20:14:34 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.43/1.12 % SZS status Started for theBenchmark.p
% 0.43/1.12 % SZS status Theorem for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.12
% 0.43/1.12 ------ iProver source info
% 0.43/1.12
% 0.43/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.12 git: non_committed_changes: false
% 0.43/1.12
% 0.43/1.12 ------ Parsing...
% 0.43/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.12 ------ Proving...
% 0.43/1.12 ------ Problem Properties
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 clauses 10
% 0.43/1.12 conjectures 3
% 0.43/1.12 EPR 7
% 0.43/1.12 Horn 8
% 0.43/1.12 unary 6
% 0.43/1.12 binary 2
% 0.43/1.12 lits 16
% 0.43/1.12 lits eq 9
% 0.43/1.12 fd_pure 0
% 0.43/1.12 fd_pseudo 0
% 0.43/1.12 fd_cond 1
% 0.43/1.12 fd_pseudo_cond 2
% 0.43/1.12 AC symbols 0
% 0.43/1.12
% 0.43/1.12 ------ Schedule dynamic 5 is on
% 0.43/1.12
% 0.43/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 ------
% 0.43/1.12 Current options:
% 0.43/1.12 ------
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 ------ Proving...
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 % SZS status Theorem for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.12
% 0.43/1.12
%------------------------------------------------------------------------------