TSTP Solution File: SET903+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET903+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.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f41)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f9,conjecture,
! [X0,X1,X2] :
~ ( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(negated_conjecture,[],[f9]) ).
fof(f15,plain,
? [X0,X1,X2] :
( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) )
=> ( empty_set != sK4
& empty_set != sK3
& sK3 != sK4
& singleton(sK2) = set_union2(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( empty_set != sK4
& empty_set != sK3
& sK3 != sK4
& singleton(sK2) = set_union2(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f15,f20]) ).
fof(f22,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f37,plain,
singleton(sK2) = set_union2(sK3,sK4),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
empty_set != sK3,
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
empty_set != sK4,
inference(cnf_transformation,[],[f21]) ).
cnf(c_49,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f22]) ).
cnf(c_56,plain,
( set_union2(X0,X1) != singleton(X2)
| singleton(X2) = X1
| X1 = empty_set ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_63,plain,
( set_union2(X0,X1) != singleton(X2)
| singleton(X2) = X0
| X0 = empty_set ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_64,negated_conjecture,
empty_set != sK4,
inference(cnf_transformation,[],[f40]) ).
cnf(c_65,negated_conjecture,
empty_set != sK3,
inference(cnf_transformation,[],[f39]) ).
cnf(c_66,negated_conjecture,
sK4 != sK3,
inference(cnf_transformation,[],[f38]) ).
cnf(c_67,negated_conjecture,
set_union2(sK3,sK4) = singleton(sK2),
inference(cnf_transformation,[],[f37]) ).
cnf(c_130,plain,
set_union2(sK4,sK3) = singleton(sK2),
inference(demodulation,[status(thm)],[c_67,c_49]) ).
cnf(c_229,negated_conjecture,
sK4 != sK3,
inference(demodulation,[status(thm)],[c_66]) ).
cnf(c_230,negated_conjecture,
empty_set != sK3,
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_231,negated_conjecture,
empty_set != sK4,
inference(demodulation,[status(thm)],[c_64]) ).
cnf(c_406,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK3
| empty_set = sK3 ),
inference(superposition,[status(thm)],[c_130,c_56]) ).
cnf(c_407,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK3 ),
inference(forward_subsumption_resolution,[status(thm)],[c_406,c_230]) ).
cnf(c_420,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK4
| empty_set = sK4 ),
inference(superposition,[status(thm)],[c_130,c_63]) ).
cnf(c_421,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK4 ),
inference(forward_subsumption_resolution,[status(thm)],[c_420,c_231]) ).
cnf(c_437,plain,
singleton(sK2) = sK3,
inference(equality_resolution,[status(thm)],[c_407]) ).
cnf(c_444,plain,
( singleton(X0) != sK3
| singleton(X0) = sK4 ),
inference(light_normalisation,[status(thm)],[c_421,c_437]) ).
cnf(c_449,plain,
singleton(sK2) = sK4,
inference(superposition,[status(thm)],[c_437,c_444]) ).
cnf(c_450,plain,
sK4 = sK3,
inference(demodulation,[status(thm)],[c_437,c_449]) ).
cnf(c_451,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_450,c_229]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET903+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:09:34 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 0.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...
% 0.45/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.13
% 0.45/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
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.13 ------ Proving...
% 0.45/1.13 ------ Problem Properties
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 clauses 14
% 0.45/1.13 conjectures 3
% 0.45/1.13 EPR 6
% 0.45/1.13 Horn 11
% 0.45/1.13 unary 9
% 0.45/1.13 binary 2
% 0.45/1.13 lits 22
% 0.45/1.13 lits eq 15
% 0.45/1.13 fd_pure 0
% 0.45/1.13 fd_pseudo 0
% 0.45/1.13 fd_cond 0
% 0.45/1.13 fd_pseudo_cond 3
% 0.45/1.13 AC symbols 0
% 0.45/1.13
% 0.45/1.13 ------ Schedule dynamic 5 is on
% 0.45/1.13
% 0.45/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------
% 0.45/1.13 Current options:
% 0.45/1.13 ------
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Proving...
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.13
% 0.45/1.13
%------------------------------------------------------------------------------