TSTP Solution File: SET886+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:55 EDT 2024
% Result : Theorem 0.48s 1.18s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_zfmisc_1) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> unordered_pair(X0,X1) = singleton(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_zfmisc_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> unordered_pair(X0,X1) = singleton(X2) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f10,plain,
! [X0,X1,X2] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) != singleton(X2)
& subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
( ? [X0,X1,X2] :
( unordered_pair(X0,X1) != singleton(X2)
& subset(unordered_pair(X0,X1),singleton(X2)) )
=> ( unordered_pair(sK2,sK3) != singleton(sK4)
& subset(unordered_pair(sK2,sK3),singleton(sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( unordered_pair(sK2,sK3) != singleton(sK4)
& subset(unordered_pair(sK2,sK3),singleton(sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f16]) ).
fof(f18,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
subset(unordered_pair(sK2,sK3),singleton(sK4)),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
unordered_pair(sK2,sK3) != singleton(sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2)) ),
inference(definition_unfolding,[],[f22,f25]) ).
fof(f27,plain,
unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4),
inference(definition_unfolding,[],[f24,f25]) ).
fof(f28,plain,
subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f23,f25]) ).
cnf(c_49,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f18]) ).
cnf(c_53,plain,
( ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2))
| X0 = X2 ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,negated_conjecture,
unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4),
inference(cnf_transformation,[],[f27]) ).
cnf(c_55,negated_conjecture,
subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_156,plain,
unordered_pair(sK2,sK3) = sP0_iProver_def,
definition ).
cnf(c_157,plain,
unordered_pair(sK4,sK4) = sP1_iProver_def,
definition ).
cnf(c_158,negated_conjecture,
subset(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_55,c_157,c_156]) ).
cnf(c_159,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_252,plain,
( ~ subset(unordered_pair(X0,X1),unordered_pair(X2,X2))
| X1 = X2 ),
inference(superposition,[status(thm)],[c_49,c_53]) ).
cnf(c_254,plain,
( ~ subset(sP0_iProver_def,unordered_pair(X0,X0))
| X0 = sK2 ),
inference(superposition,[status(thm)],[c_156,c_53]) ).
cnf(c_273,plain,
( ~ subset(sP0_iProver_def,unordered_pair(X0,X0))
| X0 = sK3 ),
inference(superposition,[status(thm)],[c_156,c_252]) ).
cnf(c_285,plain,
( ~ subset(sP0_iProver_def,sP1_iProver_def)
| sK2 = sK4 ),
inference(superposition,[status(thm)],[c_157,c_254]) ).
cnf(c_286,plain,
sK2 = sK4,
inference(forward_subsumption_resolution,[status(thm)],[c_285,c_158]) ).
cnf(c_288,plain,
unordered_pair(sK4,sK3) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_156,c_286]) ).
cnf(c_310,plain,
( ~ subset(sP0_iProver_def,sP1_iProver_def)
| sK3 = sK4 ),
inference(superposition,[status(thm)],[c_157,c_273]) ).
cnf(c_311,plain,
sK3 = sK4,
inference(forward_subsumption_resolution,[status(thm)],[c_310,c_158]) ).
cnf(c_313,plain,
unordered_pair(sK4,sK4) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_288,c_311]) ).
cnf(c_314,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_313,c_157]) ).
cnf(c_315,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_314,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:11:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.48/1.18 % SZS status Started for theBenchmark.p
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.18
% 0.48/1.18 ------ iProver source info
% 0.48/1.18
% 0.48/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.18 git: non_committed_changes: false
% 0.48/1.18
% 0.48/1.18 ------ Parsing...
% 0.48/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.18
% 0.48/1.18 ------ 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
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.18 ------ Proving...
% 0.48/1.18 ------ Problem Properties
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 clauses 8
% 0.48/1.18 conjectures 2
% 0.48/1.18 EPR 4
% 0.48/1.18 Horn 8
% 0.48/1.18 unary 7
% 0.48/1.18 binary 1
% 0.48/1.18 lits 9
% 0.48/1.18 lits eq 6
% 0.48/1.18 fd_pure 0
% 0.48/1.18 fd_pseudo 0
% 0.48/1.18 fd_cond 0
% 0.48/1.18 fd_pseudo_cond 1
% 0.48/1.18 AC symbols 0
% 0.48/1.18
% 0.48/1.18 ------ Schedule dynamic 5 is on
% 0.48/1.18
% 0.48/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------
% 0.48/1.18 Current options:
% 0.48/1.18 ------
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------ Proving...
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.18
% 0.48/1.18
%------------------------------------------------------------------------------