TSTP Solution File: SET903+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:34 EDT 2023
% Result : Theorem 1.85s 1.10s
% Output : CNFRefutation 1.85s
% 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/sandbox/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/sandbox/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_403,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK3
| empty_set = sK3 ),
inference(superposition,[status(thm)],[c_130,c_56]) ).
cnf(c_404,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK3 ),
inference(forward_subsumption_resolution,[status(thm)],[c_403,c_65]) ).
cnf(c_417,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK4
| empty_set = sK4 ),
inference(superposition,[status(thm)],[c_130,c_63]) ).
cnf(c_418,plain,
( singleton(X0) != singleton(sK2)
| singleton(X0) = sK4 ),
inference(forward_subsumption_resolution,[status(thm)],[c_417,c_64]) ).
cnf(c_434,plain,
singleton(sK2) = sK3,
inference(equality_resolution,[status(thm)],[c_404]) ).
cnf(c_441,plain,
( singleton(X0) != sK3
| singleton(X0) = sK4 ),
inference(light_normalisation,[status(thm)],[c_418,c_434]) ).
cnf(c_446,plain,
singleton(sK2) = sK4,
inference(superposition,[status(thm)],[c_434,c_441]) ).
cnf(c_447,plain,
sK4 = sK3,
inference(demodulation,[status(thm)],[c_434,c_446]) ).
cnf(c_448,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_447,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 08:51:23 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.85/1.10 % SZS status Started for theBenchmark.p
% 1.85/1.10 % SZS status Theorem for theBenchmark.p
% 1.85/1.10
% 1.85/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.85/1.10
% 1.85/1.10 ------ iProver source info
% 1.85/1.10
% 1.85/1.10 git: date: 2023-05-31 18:12:56 +0000
% 1.85/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.85/1.10 git: non_committed_changes: false
% 1.85/1.10 git: last_make_outside_of_git: false
% 1.85/1.10
% 1.85/1.10 ------ Parsing...
% 1.85/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.85/1.10
% 1.85/1.10 ------ 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
% 1.85/1.10
% 1.85/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.85/1.10
% 1.85/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.85/1.10 ------ Proving...
% 1.85/1.10 ------ Problem Properties
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10 clauses 14
% 1.85/1.10 conjectures 3
% 1.85/1.10 EPR 6
% 1.85/1.10 Horn 11
% 1.85/1.10 unary 9
% 1.85/1.10 binary 2
% 1.85/1.10 lits 22
% 1.85/1.10 lits eq 15
% 1.85/1.10 fd_pure 0
% 1.85/1.10 fd_pseudo 0
% 1.85/1.10 fd_cond 0
% 1.85/1.10 fd_pseudo_cond 3
% 1.85/1.10 AC symbols 0
% 1.85/1.10
% 1.85/1.10 ------ Schedule dynamic 5 is on
% 1.85/1.10
% 1.85/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10 ------
% 1.85/1.10 Current options:
% 1.85/1.10 ------
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10 ------ Proving...
% 1.85/1.10
% 1.85/1.10
% 1.85/1.10 % SZS status Theorem for theBenchmark.p
% 1.85/1.10
% 1.85/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/1.10
% 1.85/1.10
%------------------------------------------------------------------------------