TSTP Solution File: SET851-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET851-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:48 EDT 2024
% Result : Unsatisfiable 7.26s 1.71s
% Output : CNFRefutation 7.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 9 unt; 2 nHn; 11 RR)
% Number of literals : 20 ( 3 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_52,plain,
( ~ c_lessequals(X0,X1,tc_set(tc_set(X2)))
| c_lessequals(X0,c_Zorn_Osucc(X3,X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).
cnf(c_54,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_55,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_56,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_57,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(c_58,negated_conjecture,
( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| X0 = v_m
| c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(c_170,plain,
c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(c_23330,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_23333,plain,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_23330]) ).
cnf(c_23344,plain,
( ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| v_m = v_x ),
inference(superposition,[status(thm)],[c_58,c_55]) ).
cnf(c_23396,plain,
v_m = v_x,
inference(global_subsumption_just,[status(thm)],[c_23344,c_54,c_23333,c_23344]) ).
cnf(c_23400,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_m,t_a),tc_set(tc_set(t_a))),
inference(superposition,[status(thm)],[c_23396,c_56]) ).
cnf(c_23516,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_23400,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET851-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n026.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:50:36 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
% 7.26/1.71 % SZS status Started for theBenchmark.p
% 7.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 7.26/1.71
% 7.26/1.71 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.26/1.71
% 7.26/1.71 ------ iProver source info
% 7.26/1.71
% 7.26/1.71 git: date: 2024-05-02 19:28:25 +0000
% 7.26/1.71 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.26/1.71 git: non_committed_changes: false
% 7.26/1.71
% 7.26/1.71 ------ Parsing...successful
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71 ------ Preprocessing... sup_sim: 1 sf_s rm: 823 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e
% 7.26/1.71
% 7.26/1.71 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.26/1.71
% 7.26/1.71 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.26/1.71 ------ Proving...
% 7.26/1.71 ------ Problem Properties
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71 clauses 305
% 7.26/1.71 conjectures 6
% 7.26/1.71 EPR 26
% 7.26/1.71 Horn 273
% 7.26/1.71 unary 79
% 7.26/1.71 binary 175
% 7.26/1.71 lits 583
% 7.26/1.71 lits eq 163
% 7.26/1.71 fd_pure 0
% 7.26/1.71 fd_pseudo 0
% 7.26/1.71 fd_cond 22
% 7.26/1.71 fd_pseudo_cond 40
% 7.26/1.71 AC symbols 0
% 7.26/1.71
% 7.26/1.71 ------ Input Options Time Limit: Unbounded
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71 ------
% 7.26/1.71 Current options:
% 7.26/1.71 ------
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71 ------ Proving...
% 7.26/1.71
% 7.26/1.71
% 7.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 7.26/1.71
% 7.26/1.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.26/1.71
% 7.26/1.71
%------------------------------------------------------------------------------