TSTP Solution File: SET839-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET839-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:44 EDT 2024
% Result : Unsatisfiable 61.37s 9.17s
% Output : CNFRefutation 61.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 5 unt; 7 nHn; 10 RR)
% Number of literals : 39 ( 6 equ; 15 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ c_lessequals(v_S,c_insert(X0,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_50,negated_conjecture,
( ~ c_in(X0,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X0,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_152,plain,
( ~ c_lessequals(X0,X1,tc_set(X2))
| ~ c_less(X1,X0,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetE_0) ).
cnf(c_154,plain,
( ~ c_lessequals(X0,X1,tc_set(X2))
| X0 = X1
| c_less(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_0) ).
cnf(c_159,plain,
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(c_160,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(c_1385,plain,
c_in(X0,c_insert(X0,X1,X2),X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(c_36373,plain,
( ~ c_in(X0,v_S,tc_set(t_a))
| c_lessequals(X0,c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_159,c_50]) ).
cnf(c_36392,plain,
( ~ c_less(c_Main_OsubsetI__1(v_S,X0,tc_set(t_a)),X1,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(v_S,X0,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_36373,c_152]) ).
cnf(c_36844,plain,
( ~ c_in(X0,v_S,tc_set(t_a))
| c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = X0
| c_less(X0,c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_36373,c_154]) ).
cnf(c_36946,plain,
( ~ c_in(c_Main_OsubsetI__1(v_S,X0,tc_set(t_a)),v_S,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),v_S,tc_set(t_a))
| c_Main_OsubsetI__1(v_S,X0,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X1,tc_set(t_a))
| c_lessequals(v_S,X0,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_36844,c_36392]) ).
cnf(c_37940,plain,
( c_Main_OsubsetI__1(v_S,X0,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X1,tc_set(t_a))
| c_lessequals(v_S,X0,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_36946,c_159,c_159]) ).
cnf(c_37947,plain,
( c_Main_OsubsetI__1(v_S,c_insert(X0,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X1,tc_set(t_a))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_37940,c_49]) ).
cnf(c_37963,plain,
c_Main_OsubsetI__1(v_S,c_insert(X0,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(t_a)),
inference(superposition,[status(thm)],[c_37947,c_49]) ).
cnf(c_37988,plain,
( ~ c_in(c_Main_OsubsetI__1(v_S,c_insert(X0,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm)],[c_37963,c_160]) ).
cnf(c_38002,plain,
~ c_in(c_Main_OsubsetI__1(v_S,c_insert(X0,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(t_a)),
inference(forward_subsumption_resolution,[status(thm)],[c_37988,c_49]) ).
cnf(c_38038,plain,
$false,
inference(superposition,[status(thm)],[c_1385,c_38002]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET839-1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 20:12:42 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 61.37/9.17 % SZS status Started for theBenchmark.p
% 61.37/9.17 % SZS status Unsatisfiable for theBenchmark.p
% 61.37/9.17
% 61.37/9.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 61.37/9.17
% 61.37/9.17 ------ iProver source info
% 61.37/9.17
% 61.37/9.17 git: date: 2024-05-02 19:28:25 +0000
% 61.37/9.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 61.37/9.17 git: non_committed_changes: false
% 61.37/9.17
% 61.37/9.17 ------ Parsing...successful
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17 ------ 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 sup_sim: 0 sf_s rm: 69 0s sf_e pe_s pe_e
% 61.37/9.17
% 61.37/9.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 61.37/9.17
% 61.37/9.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 61.37/9.17 ------ Proving...
% 61.37/9.17 ------ Problem Properties
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17 clauses 297
% 61.37/9.17 conjectures 2
% 61.37/9.17 EPR 26
% 61.37/9.17 Horn 270
% 61.37/9.17 unary 76
% 61.37/9.17 binary 173
% 61.37/9.17 lits 566
% 61.37/9.17 lits eq 162
% 61.37/9.17 fd_pure 0
% 61.37/9.17 fd_pseudo 0
% 61.37/9.17 fd_cond 21
% 61.37/9.17 fd_pseudo_cond 40
% 61.37/9.17 AC symbols 0
% 61.37/9.17
% 61.37/9.17 ------ Input Options Time Limit: Unbounded
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17 ------
% 61.37/9.17 Current options:
% 61.37/9.17 ------
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17 ------ Proving...
% 61.37/9.17
% 61.37/9.17
% 61.37/9.17 % SZS status Unsatisfiable for theBenchmark.p
% 61.37/9.17
% 61.37/9.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 61.37/9.18
% 61.37/9.18
%------------------------------------------------------------------------------