TSTP Solution File: SWV580-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV580-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 22:41:57 EDT 2023
% Result : Unsatisfiable 8.08s 1.68s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 4 unt; 0 nHn; 12 RR)
% Number of literals : 28 ( 19 equ; 17 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-4 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_555,plain,
( ~ c_HOL_Oord__class_Oless(X0,X1,X2)
| ~ class_Orderings_Olinorder(X2)
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),X2),c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X1,X2),tc_fun(X2,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_ivl__disj__un_I3_J_0) ).
cnf(c_600,plain,
c_HOL_Oord__class_Oless(v_m,v_n,tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_602,negated_conjecture,
c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_631,plain,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_nat__Orderings_Olinorder) ).
cnf(c_2521,plain,
( X0 != tc_nat
| ~ c_HOL_Oord__class_Oless(X1,X2,X0)
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(X0,tc_bool)),X0),c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,X0),tc_fun(X0,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,X0) ),
inference(resolution_lifted,[status(thm)],[c_555,c_631]) ).
cnf(c_2522,plain,
( ~ c_HOL_Oord__class_Oless(X0,X1,tc_nat)
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X1,tc_nat),tc_fun(tc_nat,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X1,tc_nat) ),
inference(unflattening,[status(thm)],[c_2521]) ).
cnf(c_3901,plain,
( ~ c_HOL_Oord__class_Oless(X0,X1,tc_nat)
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X1,tc_nat),tc_fun(tc_nat,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X1,tc_nat) ),
inference(prop_impl_just,[status(thm)],[c_2522]) ).
cnf(c_6363,plain,
( X0 != X1
| X2 != X3
| X4 != X5
| X6 != X7
| c_Finite__Set_Osetsum(X0,X2,X4,X6) = c_Finite__Set_Osetsum(X1,X3,X5,X7) ),
theory(equality) ).
cnf(c_7753,plain,
( c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)) != c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat)
| v_f != v_f
| t_a != t_a
| tc_nat != tc_nat
| c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) = c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a) ),
inference(instantiation,[status(thm)],[c_6363]) ).
cnf(c_7754,plain,
( c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)) != c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat)
| c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) = c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a) ),
inference(equality_resolution_simp,[status(thm)],[c_7753]) ).
cnf(c_12564,plain,
( ~ c_HOL_Oord__class_Oless(v_m,v_n,tc_nat)
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat) ),
inference(instantiation,[status(thm)],[c_3901]) ).
cnf(c_12565,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12564,c_7754,c_602,c_600]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV580-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 07:14:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.08/1.68 % SZS status Started for theBenchmark.p
% 8.08/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 8.08/1.68
% 8.08/1.68 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 8.08/1.68
% 8.08/1.68 ------ iProver source info
% 8.08/1.68
% 8.08/1.68 git: date: 2023-05-31 18:12:56 +0000
% 8.08/1.68 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 8.08/1.68 git: non_committed_changes: false
% 8.08/1.68 git: last_make_outside_of_git: false
% 8.08/1.68
% 8.08/1.68 ------ Parsing...successful
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68 ------ Preprocessing... sup_sim: 1 pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 2 pe_s pe_e
% 8.08/1.68
% 8.08/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 4 0s scvd_e snvd_s sp: 0 0s snvd_e
% 8.08/1.68
% 8.08/1.68 ------ Preprocessing...
% 8.08/1.68 ------ Proving...
% 8.08/1.68 ------ Problem Properties
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68 clauses 463
% 8.08/1.68 conjectures 2
% 8.08/1.68 EPR 49
% 8.08/1.68 Horn 396
% 8.08/1.68 unary 133
% 8.08/1.68 binary 207
% 8.08/1.68 lits 938
% 8.08/1.68 lits eq 284
% 8.08/1.68 fd_pure 0
% 8.08/1.68 fd_pseudo 0
% 8.08/1.68 fd_cond 5
% 8.08/1.68 fd_pseudo_cond 27
% 8.08/1.68 AC symbols 0
% 8.08/1.68
% 8.08/1.68 ------ Input Options Time Limit: Unbounded
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68 ------
% 8.08/1.68 Current options:
% 8.08/1.68 ------
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68 ------ Proving...
% 8.08/1.68
% 8.08/1.68
% 8.08/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 8.08/1.68
% 8.08/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.08/1.68
% 8.08/1.68
%------------------------------------------------------------------------------