TSTP Solution File: MGT016-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : MGT016-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 02:43:21 EDT 2024
% Result : Unsatisfiable 0.52s 1.11s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 41 ( 22 unt; 9 nHn; 41 RR)
% Number of literals : 194 ( 0 equ; 146 neg)
% Maximal clause size : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_1) ).
cnf(c_50,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ class(X0,X6,X2)
| ~ class(X3,X6,X5)
| ~ complexity(X0,X7,X2)
| ~ complexity(X3,X8,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X8,X7)
| greater(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL_2) ).
cnf(c_51,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X2)
| ~ class(X0,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X0,X2,X6)
| ~ reorganization(X3,X2,X7)
| ~ reorganization_type(X0,X8,X2)
| ~ reorganization_type(X3,X8,X2)
| ~ organization(X0,X2)
| ~ organization(X3,X2)
| ~ greater(X4,X1)
| organization(X3,X7)
| greater(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_FOL_3) ).
cnf(c_52,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_4) ).
cnf(c_53,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_5) ).
cnf(c_54,negated_conjecture,
~ organization(sk3,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_6) ).
cnf(c_55,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_7) ).
cnf(c_56,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_8) ).
cnf(c_57,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_9) ).
cnf(c_58,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_10) ).
cnf(c_59,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_11) ).
cnf(c_60,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_12) ).
cnf(c_61,negated_conjecture,
complexity(sk2,sk6,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_13) ).
cnf(c_62,negated_conjecture,
complexity(sk3,sk7,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_14) ).
cnf(c_63,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_15) ).
cnf(c_64,negated_conjecture,
~ greater(sk9,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_FOL_16) ).
cnf(c_143,negated_conjecture,
greater(sk7,sk6),
inference(demodulation,[status(thm)],[c_63]) ).
cnf(c_144,negated_conjecture,
complexity(sk3,sk7,sk8),
inference(demodulation,[status(thm)],[c_62]) ).
cnf(c_145,negated_conjecture,
complexity(sk2,sk6,sk8),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_150,negated_conjecture,
class(sk3,sk5,sk8),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_151,negated_conjecture,
class(sk2,sk5,sk8),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_153,negated_conjecture,
organization(sk3,sk8),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_154,negated_conjecture,
organization(sk2,sk8),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_155,plain,
( ~ organization(sk2,sk8)
| inertia(sk2,sk1(sk8,sk2),sk8) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_156,plain,
( ~ organization(sk3,sk8)
| inertia(sk3,sk1(sk8,sk3),sk8) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_159,plain,
( ~ inertia(X0,X1,sk8)
| ~ class(X0,X2,sk8)
| ~ reorganization(X0,sk8,X3)
| ~ reorganization_type(X0,X4,sk8)
| ~ inertia(sk2,X5,sk8)
| ~ class(sk2,X2,sk8)
| ~ reorganization(sk2,sk8,X6)
| ~ reorganization_type(sk2,X4,sk8)
| ~ greater(X1,X5)
| ~ organization(X0,sk8)
| ~ organization(sk2,sk8)
| organization(X0,X3)
| greater(X6,X3) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_166,plain,
( ~ inertia(sk2,X0,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ class(sk2,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(sk2,sk8,X3)
| ~ reorganization(sk3,sk8,X4)
| ~ reorganization_type(sk2,X5,sk8)
| ~ reorganization_type(sk3,X5,sk8)
| ~ greater(X1,X0)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| greater(X3,X4)
| organization(sk3,X4) ),
inference(instantiation,[status(thm)],[c_159]) ).
cnf(c_196,plain,
( ~ inertia(sk2,X0,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ class(sk2,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(sk2,sk8,X3)
| ~ reorganization_type(sk2,X4,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ reorganization(sk3,sk8,sk10)
| ~ greater(X1,X0)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| greater(X3,sk10)
| organization(sk3,sk10) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_215,plain,
( ~ inertia(sk2,X0,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ class(sk2,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization_type(sk2,X3,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| ~ reorganization(sk2,sk8,sk9)
| ~ reorganization(sk3,sk8,sk10)
| ~ greater(X1,X0)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| organization(sk3,sk10)
| greater(sk9,sk10) ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_262,plain,
( ~ inertia(sk2,sk1(sk8,sk2),sk8)
| ~ greater(X0,sk1(sk8,sk2))
| ~ inertia(sk3,X0,sk8)
| ~ class(sk2,X1,sk8)
| ~ class(sk3,X1,sk8)
| ~ reorganization_type(sk2,X2,sk8)
| ~ reorganization_type(sk3,X2,sk8)
| ~ reorganization(sk2,sk8,sk9)
| ~ reorganization(sk3,sk8,sk10)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| organization(sk3,sk10)
| greater(sk9,sk10) ),
inference(instantiation,[status(thm)],[c_215]) ).
cnf(c_310,plain,
( ~ inertia(X0,X1,X2)
| ~ class(X0,X4,X2)
| ~ class(X3,X4,X5)
| ~ complexity(X0,X7,X2)
| ~ complexity(X3,X6,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X7,X6)
| greater(X1,sk1(X5,X3)) ),
inference(superposition,[status(thm)],[c_49,c_50]) ).
cnf(c_377,plain,
( ~ class(X0,X1,X2)
| ~ class(X3,X1,X4)
| ~ complexity(X0,X5,X2)
| ~ complexity(X3,X6,X4)
| ~ organization(X0,X2)
| ~ organization(X3,X4)
| ~ greater(X5,X6)
| greater(sk1(X2,X0),sk1(X4,X3)) ),
inference(superposition,[status(thm)],[c_49,c_310]) ).
cnf(c_440,plain,
( ~ class(X0,X1,X2)
| ~ complexity(X0,X3,X2)
| ~ class(sk2,X1,sk8)
| ~ organization(X0,X2)
| ~ greater(X3,sk6)
| ~ organization(sk2,sk8)
| greater(sk1(X2,X0),sk1(sk8,sk2)) ),
inference(superposition,[status(thm)],[c_145,c_377]) ).
cnf(c_449,plain,
( ~ class(X0,X1,X2)
| ~ complexity(X0,X3,X2)
| ~ class(sk2,X1,sk8)
| ~ organization(X0,X2)
| ~ greater(X3,sk6)
| greater(sk1(X2,X0),sk1(sk8,sk2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_440,c_154]) ).
cnf(c_680,plain,
( ~ complexity(X0,X1,X2)
| ~ class(X0,sk5,X2)
| ~ organization(X0,X2)
| ~ greater(X1,sk6)
| greater(sk1(X2,X0),sk1(sk8,sk2)) ),
inference(superposition,[status(thm)],[c_151,c_449]) ).
cnf(c_705,plain,
( ~ greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ inertia(sk2,sk1(sk8,sk2),sk8)
| ~ inertia(sk3,sk1(sk8,sk3),sk8)
| ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization_type(sk2,X1,sk8)
| ~ reorganization_type(sk3,X1,sk8)
| ~ reorganization(sk2,sk8,sk9)
| ~ reorganization(sk3,sk8,sk10)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| organization(sk3,sk10)
| greater(sk9,sk10) ),
inference(instantiation,[status(thm)],[c_262]) ).
cnf(c_725,plain,
( ~ class(sk3,sk5,sk8)
| ~ organization(sk3,sk8)
| ~ greater(sk7,sk6)
| greater(sk1(sk8,sk3),sk1(sk8,sk2)) ),
inference(superposition,[status(thm)],[c_144,c_680]) ).
cnf(c_726,plain,
greater(sk1(sk8,sk3),sk1(sk8,sk2)),
inference(forward_subsumption_resolution,[status(thm)],[c_725,c_143,c_153,c_150]) ).
cnf(c_1011,plain,
( ~ greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ inertia(sk2,sk1(sk8,sk2),sk8)
| ~ inertia(sk3,sk1(sk8,sk3),sk8)
| ~ reorganization_type(sk2,X0,sk8)
| ~ reorganization_type(sk3,X0,sk8)
| ~ class(sk2,sk5,sk8)
| ~ class(sk3,sk5,sk8)
| ~ reorganization(sk2,sk8,sk9)
| ~ reorganization(sk3,sk8,sk10)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| organization(sk3,sk10)
| greater(sk9,sk10) ),
inference(instantiation,[status(thm)],[c_705]) ).
cnf(c_1026,plain,
( ~ greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ inertia(sk2,sk1(sk8,sk2),sk8)
| ~ inertia(sk3,sk1(sk8,sk3),sk8)
| ~ class(sk2,sk5,sk8)
| ~ class(sk3,sk5,sk8)
| ~ reorganization(sk2,sk8,sk9)
| ~ reorganization(sk3,sk8,sk10)
| ~ reorganization_type(sk2,sk4,sk8)
| ~ reorganization_type(sk3,sk4,sk8)
| ~ organization(sk2,sk8)
| ~ organization(sk3,sk8)
| organization(sk3,sk10)
| greater(sk9,sk10) ),
inference(instantiation,[status(thm)],[c_1011]) ).
cnf(c_1027,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1026,c_726,c_156,c_155,c_54,c_55,c_56,c_57,c_58,c_59,c_60,c_64,c_52,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : MGT016-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n002.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 23:12:12 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 0.52/1.11 % SZS status Started for theBenchmark.p
% 0.52/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 0.52/1.11
% 0.52/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.52/1.11
% 0.52/1.11 ------ iProver source info
% 0.52/1.11
% 0.52/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.52/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.52/1.11 git: non_committed_changes: false
% 0.52/1.11
% 0.52/1.11 ------ Parsing...successful
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.52/1.11
% 0.52/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.52/1.11 ------ Proving...
% 0.52/1.11 ------ Problem Properties
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11 clauses 16
% 0.52/1.11 conjectures 13
% 0.52/1.11 EPR 15
% 0.52/1.11 Horn 15
% 0.52/1.11 unary 13
% 0.52/1.11 binary 1
% 0.52/1.11 lits 38
% 0.52/1.11 lits eq 0
% 0.52/1.11 fd_pure 0
% 0.52/1.11 fd_pseudo 0
% 0.52/1.11 fd_cond 0
% 0.52/1.11 fd_pseudo_cond 0
% 0.52/1.11 AC symbols 0
% 0.52/1.11
% 0.52/1.11 ------ Schedule dynamic 5 is on
% 0.52/1.11
% 0.52/1.11 ------ no equalities: superposition off
% 0.52/1.11
% 0.52/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11 ------
% 0.52/1.11 Current options:
% 0.52/1.11 ------
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11 ------ Proving...
% 0.52/1.11
% 0.52/1.11
% 0.52/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 0.52/1.11
% 0.52/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.52/1.11
% 0.52/1.11
%------------------------------------------------------------------------------