TSTP Solution File: SET844-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET844-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 : Mon Jun 24 14:36:17 EDT 2024
% Result : Unsatisfiable 2.10s 1.16s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
cnf(c_50,plain,
( ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2))))
| c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(c_51,plain,
( c_Zorn_Osucc(X0,X1,X2) != X1
| ~ c_in(X1,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
| ~ c_in(X3,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
| c_lessequals(X3,X1,tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Oeq__succ__upper_0) ).
cnf(c_52,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_53,negated_conjecture,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_54,negated_conjecture,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_161,plain,
c_Zorn_OTFin(v_S,t_a) = sP0_iProver_def,
definition ).
cnf(c_162,plain,
tc_set(t_a) = sP1_iProver_def,
definition ).
cnf(c_163,plain,
c_Union(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_164,plain,
tc_set(sP1_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_165,plain,
c_Zorn_Osucc(v_S,v_m,t_a) = sP4_iProver_def,
definition ).
cnf(c_166,negated_conjecture,
~ c_lessequals(sP2_iProver_def,v_m,sP3_iProver_def),
inference(demodulation,[status(thm)],[c_54,c_164,c_162,c_161,c_163]) ).
cnf(c_167,negated_conjecture,
sP4_iProver_def = v_m,
inference(demodulation,[status(thm)],[c_53,c_165]) ).
cnf(c_168,negated_conjecture,
c_in(v_m,sP0_iProver_def,sP3_iProver_def),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_350,plain,
c_in(sP4_iProver_def,sP0_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_168,c_167]) ).
cnf(c_351,plain,
~ c_lessequals(sP2_iProver_def,sP4_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_166,c_167]) ).
cnf(c_356,plain,
c_Zorn_Osucc(v_S,sP4_iProver_def,t_a) = sP4_iProver_def,
inference(light_normalisation,[status(thm)],[c_165,c_167]) ).
cnf(c_361,plain,
( ~ c_lessequals(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a))))
| c_in(c_Union(X0,tc_set(t_a)),sP0_iProver_def,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_161,c_50]) ).
cnf(c_370,plain,
( ~ c_lessequals(X0,sP0_iProver_def,tc_set(sP3_iProver_def))
| c_in(c_Union(X0,sP1_iProver_def),sP0_iProver_def,sP3_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_361,c_161,c_162,c_164]) ).
cnf(c_384,plain,
( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(sP4_iProver_def,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(X0,sP4_iProver_def,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_356,c_51]) ).
cnf(c_385,plain,
( ~ c_in(X0,sP0_iProver_def,sP3_iProver_def)
| ~ c_in(sP4_iProver_def,sP0_iProver_def,sP3_iProver_def)
| c_lessequals(X0,sP4_iProver_def,sP3_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_384,c_161,c_162,c_164]) ).
cnf(c_386,plain,
( ~ c_in(X0,sP0_iProver_def,sP3_iProver_def)
| c_lessequals(X0,sP4_iProver_def,sP3_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_385,c_350]) ).
cnf(c_399,plain,
( ~ c_lessequals(sP0_iProver_def,sP0_iProver_def,tc_set(sP3_iProver_def))
| c_in(sP2_iProver_def,sP0_iProver_def,sP3_iProver_def) ),
inference(superposition,[status(thm)],[c_163,c_370]) ).
cnf(c_401,plain,
c_in(sP2_iProver_def,sP0_iProver_def,sP3_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_399,c_49]) ).
cnf(c_405,plain,
c_lessequals(sP2_iProver_def,sP4_iProver_def,sP3_iProver_def),
inference(superposition,[status(thm)],[c_401,c_386]) ).
cnf(c_406,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_405,c_351]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET844-2 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n001.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 : Sun Jun 23 16:15:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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
% 2.10/1.16 % SZS status Started for theBenchmark.p
% 2.10/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/1.16
% 2.10/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.10/1.16
% 2.10/1.16 ------ iProver source info
% 2.10/1.16
% 2.10/1.16 git: date: 2024-06-12 09:56:46 +0000
% 2.10/1.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.10/1.16 git: non_committed_changes: false
% 2.10/1.16
% 2.10/1.16 ------ Parsing...successful
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.10/1.16
% 2.10/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.10/1.16
% 2.10/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.10/1.16 ------ Proving...
% 2.10/1.16 ------ Problem Properties
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16 clauses 11
% 2.10/1.16 conjectures 3
% 2.10/1.16 EPR 3
% 2.10/1.16 Horn 11
% 2.10/1.16 unary 9
% 2.10/1.16 binary 1
% 2.10/1.16 lits 15
% 2.10/1.16 lits eq 7
% 2.10/1.16 fd_pure 0
% 2.10/1.16 fd_pseudo 0
% 2.10/1.16 fd_cond 0
% 2.10/1.16 fd_pseudo_cond 0
% 2.10/1.16 AC symbols 0
% 2.10/1.16
% 2.10/1.16 ------ Schedule dynamic 5 is on
% 2.10/1.16
% 2.10/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16 ------
% 2.10/1.16 Current options:
% 2.10/1.16 ------
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16 ------ Proving...
% 2.10/1.16
% 2.10/1.16
% 2.10/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/1.16
% 2.10/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.10/1.16
% 2.10/1.16
%------------------------------------------------------------------------------