TSTP Solution File: MGT013-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 09:14:09 EDT 2023
% Result : Unsatisfiable 2.18s 1.16s
% Output : CNFRefutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of clauses : 51 ( 13 unt; 4 nHn; 51 RR)
% Number of literals : 182 ( 29 equ; 137 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 80 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( X0 != X1
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).
cnf(c_51,plain,
( ~ organization(X0,X1)
| time(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).
cnf(c_52,plain,
( ~ time(X0)
| ~ time(X1)
| X0 = X1
| greater(X0,X1)
| greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).
cnf(c_53,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).
cnf(c_54,plain,
( X0 != X1
| ~ complexity(X2,X3,X0)
| ~ complexity(X2,X4,X1)
| ~ organization(X2,X0)
| ~ organization(X2,X1)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18_23) ).
cnf(c_55,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ organization(X0,X1)
| ~ organization(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).
cnf(c_56,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ organization(X0,X1)
| ~ organization(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).
cnf(c_57,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_26) ).
cnf(c_58,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_27) ).
cnf(c_59,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_28) ).
cnf(c_60,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_29) ).
cnf(c_61,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_30) ).
cnf(c_62,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_31) ).
cnf(c_63,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_32) ).
cnf(c_64,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_33) ).
cnf(c_65,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_34) ).
cnf(c_66,plain,
~ greater(X0,X0),
inference(unflattening,[status(thm)],[c_49]) ).
cnf(c_67,plain,
( ~ complexity(X0,X1,X2)
| ~ complexity(X0,X3,X2)
| ~ organization(X0,X2)
| X1 = X3 ),
inference(unflattening,[status(thm)],[c_54]) ).
cnf(c_136,plain,
( ~ complexity(X0_13,X0_14,X1_14)
| ~ complexity(X0_13,X2_14,X1_14)
| ~ organization(X0_13,X1_14)
| X0_14 = X2_14 ),
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_137,plain,
~ greater(X0_14,X0_14),
inference(subtyping,[status(esa)],[c_66]) ).
cnf(c_147,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ complexity(X0_13,X2_14,X0_14)
| ~ complexity(X0_13,X3_14,X1_14)
| ~ greater(X1_14,X0_14)
| ~ greater(X2_14,X3_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14) ),
inference(subtyping,[status(esa)],[c_56]) ).
cnf(c_148,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ size(X0_13,X2_14,X0_14)
| ~ size(X0_13,X3_14,X1_14)
| ~ greater(X1_14,X0_14)
| ~ greater(X2_14,X3_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14) ),
inference(subtyping,[status(esa)],[c_55]) ).
cnf(c_149,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| reorganization_free(X0_13,X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_53]) ).
cnf(c_150,plain,
( ~ time(X0_14)
| ~ time(X1_14)
| X1_14 = X0_14
| greater(X0_14,X1_14)
| greater(X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_52]) ).
cnf(c_151,plain,
( ~ organization(X0_13,X0_14)
| time(X0_14) ),
inference(subtyping,[status(esa)],[c_51]) ).
cnf(c_156,plain,
( X0_14 != X1_14
| X2_14 != X3_14
| ~ greater(X1_14,X3_14)
| greater(X0_14,X2_14) ),
theory(equality) ).
cnf(c_159,plain,
( X0_14 != X1_14
| X2_14 != X3_14
| ~ complexity(X0_13,X1_14,X3_14)
| complexity(X0_13,X0_14,X2_14) ),
theory(equality) ).
cnf(c_164,plain,
( ~ organization(sk1,sk6)
| time(sk6) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_165,plain,
( ~ reorganization_free(sk1,sk6,sk7)
| reorganization_free(sk1,sk7,sk6) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_168,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ complexity(X0_13,sk2,X1_14)
| ~ complexity(X0_13,sk3,X0_14)
| ~ greater(X1_14,X0_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14)
| ~ greater(sk3,sk2) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_172,plain,
( ~ complexity(sk1,X0_14,sk6)
| ~ complexity(sk1,sk2,sk6)
| ~ organization(sk1,sk6)
| X0_14 = sk2 ),
inference(instantiation,[status(thm)],[c_136]) ).
cnf(c_174,plain,
( ~ complexity(sk1,X0_14,sk7)
| ~ complexity(sk1,sk3,sk7)
| ~ organization(sk1,sk7)
| X0_14 = sk3 ),
inference(instantiation,[status(thm)],[c_136]) ).
cnf(c_182,plain,
( X0_14 != sk2
| X1_14 != sk6
| ~ complexity(sk1,sk2,sk6)
| complexity(sk1,X0_14,X1_14) ),
inference(instantiation,[status(thm)],[c_159]) ).
cnf(c_209,plain,
( ~ complexity(sk1,sk2,sk6)
| ~ organization(sk1,sk6)
| sk2 = sk2 ),
inference(instantiation,[status(thm)],[c_172]) ).
cnf(c_249,plain,
( X0_14 != sk6
| sk2 != sk2
| ~ complexity(sk1,sk2,sk6)
| complexity(sk1,sk2,X0_14) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_270,plain,
( ~ time(X0_14)
| ~ time(sk7)
| sk7 = X0_14
| greater(X0_14,sk7)
| greater(sk7,X0_14) ),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_271,plain,
( ~ time(sk6)
| ~ time(sk7)
| sk7 = sk6
| greater(sk6,sk7)
| greater(sk7,sk6) ),
inference(instantiation,[status(thm)],[c_270]) ).
cnf(c_302,plain,
( ~ organization(X0_13,sk7)
| time(sk7) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_303,plain,
( ~ organization(sk1,sk7)
| time(sk7) ),
inference(instantiation,[status(thm)],[c_302]) ).
cnf(c_346,plain,
( sk7 != sk6
| sk2 != sk2
| ~ complexity(sk1,sk2,sk6)
| complexity(sk1,sk2,sk7) ),
inference(instantiation,[status(thm)],[c_249]) ).
cnf(c_347,plain,
( ~ complexity(sk1,sk2,sk7)
| ~ complexity(sk1,sk3,sk7)
| ~ organization(sk1,sk7)
| sk2 = sk3 ),
inference(instantiation,[status(thm)],[c_174]) ).
cnf(c_374,plain,
( ~ reorganization_free(X0_13,sk7,X0_14)
| ~ complexity(X0_13,sk2,X0_14)
| ~ complexity(X0_13,sk3,sk7)
| ~ organization(X0_13,X0_14)
| ~ greater(X0_14,sk7)
| ~ organization(X0_13,sk7)
| ~ greater(sk3,sk2) ),
inference(instantiation,[status(thm)],[c_168]) ).
cnf(c_377,plain,
( ~ reorganization_free(sk1,sk7,sk6)
| ~ complexity(sk1,sk2,sk6)
| ~ complexity(sk1,sk3,sk7)
| ~ greater(sk6,sk7)
| ~ greater(sk3,sk2)
| ~ organization(sk1,sk6)
| ~ organization(sk1,sk7) ),
inference(instantiation,[status(thm)],[c_374]) ).
cnf(c_422,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ size(X0_13,sk4,X0_14)
| ~ size(X0_13,sk5,X1_14)
| ~ greater(X1_14,X0_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14)
| ~ greater(sk4,sk5) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_425,plain,
( X0_14 != sk3
| X1_14 != sk2
| ~ greater(sk3,sk2)
| greater(X0_14,X1_14) ),
inference(instantiation,[status(thm)],[c_156]) ).
cnf(c_445,plain,
( X0_14 != sk3
| sk2 != sk2
| ~ greater(sk3,sk2)
| greater(X0_14,sk2) ),
inference(instantiation,[status(thm)],[c_425]) ).
cnf(c_518,plain,
( ~ reorganization_free(X0_13,X0_14,sk7)
| ~ size(X0_13,sk4,X0_14)
| ~ size(X0_13,sk5,sk7)
| ~ organization(X0_13,X0_14)
| ~ greater(sk7,X0_14)
| ~ organization(X0_13,sk7)
| ~ greater(sk4,sk5) ),
inference(instantiation,[status(thm)],[c_422]) ).
cnf(c_526,plain,
( ~ reorganization_free(sk1,sk6,sk7)
| ~ size(sk1,sk4,sk6)
| ~ size(sk1,sk5,sk7)
| ~ greater(sk7,sk6)
| ~ greater(sk4,sk5)
| ~ organization(sk1,sk6)
| ~ organization(sk1,sk7) ),
inference(instantiation,[status(thm)],[c_518]) ).
cnf(c_874,plain,
( sk2 != sk2
| sk2 != sk3
| ~ greater(sk3,sk2)
| greater(sk2,sk2) ),
inference(instantiation,[status(thm)],[c_445]) ).
cnf(c_1084,plain,
~ greater(sk2,sk2),
inference(instantiation,[status(thm)],[c_137]) ).
cnf(c_1085,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1084,c_874,c_526,c_377,c_347,c_346,c_303,c_271,c_209,c_165,c_164,c_59,c_60,c_61,c_62,c_63,c_57,c_58,c_64,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.17/0.34 % Computer : n012.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Mon Aug 28 06:15:25 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.18/1.16 % SZS status Started for theBenchmark.p
% 2.18/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.18/1.16
% 2.18/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.18/1.16
% 2.18/1.16 ------ iProver source info
% 2.18/1.16
% 2.18/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.18/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.18/1.16 git: non_committed_changes: false
% 2.18/1.16 git: last_make_outside_of_git: false
% 2.18/1.16
% 2.18/1.16 ------ Parsing...successful
% 2.18/1.16
% 2.18/1.16 ------ preprocesses with Option_epr_non_horn_eq
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.18/1.16
% 2.18/1.16 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_eq
% 2.18/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e ------ preprocesses with Option_epr_non_horn_eq
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.18/1.16 ------ Proving...
% 2.18/1.16 ------ Problem Properties
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 clauses 17
% 2.18/1.16 conjectures 9
% 2.18/1.16 EPR 17
% 2.18/1.16 Horn 16
% 2.18/1.16 unary 10
% 2.18/1.16 binary 3
% 2.18/1.16 lits 39
% 2.18/1.16 lits eq 2
% 2.18/1.16 fd_pure 0
% 2.18/1.16 fd_pseudo 0
% 2.18/1.16 fd_cond 0
% 2.18/1.16 fd_pseudo_cond 2
% 2.18/1.16 AC symbols 0
% 2.18/1.16
% 2.18/1.16 ------ Schedule EPR non Horn eq is on
% 2.18/1.16
% 2.18/1.16 ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 ------
% 2.18/1.16 Current options:
% 2.18/1.16 ------
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 ------ Proving...
% 2.18/1.16
% 2.18/1.16
% 2.18/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.18/1.16
% 2.18/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.18/1.16
% 2.18/1.16
%------------------------------------------------------------------------------