TSTP Solution File: MGT038-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT038-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:30 EDT 2023
% Result : Satisfiable 1.61s 1.15s
% Output : Saturation 1.61s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
finite_set(first_movers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp7_first_movers_exist_17) ).
cnf(c_50,plain,
( ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,appear(first_movers,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_stable_first_movers_18) ).
cnf(c_51,plain,
( ~ contracts_from(X0,X1)
| ~ finite_set(X1)
| greater(sk1(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracting_time_19) ).
cnf(c_52,plain,
( ~ contracts_from(X0,X1)
| ~ finite_set(X1)
| cardinality_at_time(s,t2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracting_time_20) ).
cnf(c_53,plain,
( ~ in_environment(X0,X1)
| ~ greater(X2,X1)
| ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_long_stable_environments_21) ).
cnf(c_54,plain,
( ~ greater(X0,X1)
| ~ greater(X1,X2)
| greater(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity_22) ).
cnf(c_55,plain,
( ~ environment(X0)
| ~ stable(X0)
| greater(sk2(X0),appear(efficient_producers,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_23) ).
cnf(c_56,plain,
( ~ environment(X0)
| ~ stable(X0)
| contracts_from(sk2(X0),first_movers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_24) ).
cnf(c_57,plain,
( ~ environment(X0)
| greater(appear(efficient_producers,e),appear(first_movers,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_25) ).
cnf(c_58,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t7_26) ).
cnf(c_59,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t7_27) ).
cnf(c_60,negated_conjecture,
( cardinality_at_time(first_movers,to) != zero
| ~ greater(X0,appear(first_movers,sk3))
| ~ in_environment(sk3,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t7_28) ).
cnf(c_187,plain,
( X0 != X1
| ~ finite_set(X1)
| finite_set(X0) ),
theory(equality) ).
cnf(c_188,plain,
( X0 != X1
| ~ environment(X1)
| environment(X0) ),
theory(equality) ).
cnf(c_189,plain,
( X0 != X1
| ~ stable(X1)
| stable(X0) ),
theory(equality) ).
cnf(c_192,plain,
( X0 != X1
| X2 != X3
| ~ contracts_from(X1,X3)
| contracts_from(X0,X2) ),
theory(equality) ).
cnf(c_195,plain,
( X0 != first_movers
| ~ contracts_from(X1,X0)
| cardinality_at_time(s,t2) = zero ),
inference(resolution_lifted,[status(thm)],[c_49,c_52]) ).
cnf(c_196,plain,
( ~ contracts_from(X0,first_movers)
| cardinality_at_time(s,t2) = zero ),
inference(unflattening,[status(thm)],[c_195]) ).
cnf(c_204,plain,
( X0 != first_movers
| ~ contracts_from(X1,X0)
| greater(sk1(X1,X0),X1) ),
inference(resolution_lifted,[status(thm)],[c_49,c_51]) ).
cnf(c_205,plain,
( ~ contracts_from(X0,first_movers)
| greater(sk1(X0,first_movers),X0) ),
inference(unflattening,[status(thm)],[c_204]) ).
cnf(c_247,plain,
( X0 != sk3
| ~ environment(X0)
| contracts_from(sk2(X0),first_movers) ),
inference(resolution_lifted,[status(thm)],[c_56,c_59]) ).
cnf(c_248,plain,
( ~ environment(sk3)
| contracts_from(sk2(sk3),first_movers) ),
inference(unflattening,[status(thm)],[c_247]) ).
cnf(c_249,plain,
contracts_from(sk2(sk3),first_movers),
inference(global_subsumption_just,[status(thm)],[c_248,c_58,c_248]) ).
cnf(c_254,plain,
( X0 != sk3
| ~ environment(X0)
| greater(sk2(X0),appear(efficient_producers,X0)) ),
inference(resolution_lifted,[status(thm)],[c_55,c_59]) ).
cnf(c_255,plain,
( ~ environment(sk3)
| greater(sk2(sk3),appear(efficient_producers,sk3)) ),
inference(unflattening,[status(thm)],[c_254]) ).
cnf(c_256,plain,
greater(sk2(sk3),appear(efficient_producers,sk3)),
inference(global_subsumption_just,[status(thm)],[c_255,c_58,c_255]) ).
cnf(c_261,plain,
( X0 != sk3
| ~ in_environment(X0,X1)
| ~ greater(X2,X1)
| ~ environment(X0)
| in_environment(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_59]) ).
cnf(c_262,plain,
( ~ greater(X0,X1)
| ~ in_environment(sk3,X1)
| ~ environment(sk3)
| in_environment(sk3,X0) ),
inference(unflattening,[status(thm)],[c_261]) ).
cnf(c_263,plain,
( ~ in_environment(sk3,X1)
| ~ greater(X0,X1)
| in_environment(sk3,X0) ),
inference(global_subsumption_just,[status(thm)],[c_262,c_58,c_262]) ).
cnf(c_264,plain,
( ~ greater(X0,X1)
| ~ in_environment(sk3,X1)
| in_environment(sk3,X0) ),
inference(renaming,[status(thm)],[c_263]) ).
cnf(c_274,plain,
( X0 != sk3
| ~ environment(X0)
| in_environment(X0,appear(first_movers,X0)) ),
inference(resolution_lifted,[status(thm)],[c_50,c_59]) ).
cnf(c_275,plain,
( ~ environment(sk3)
| in_environment(sk3,appear(first_movers,sk3)) ),
inference(unflattening,[status(thm)],[c_274]) ).
cnf(c_276,plain,
in_environment(sk3,appear(first_movers,sk3)),
inference(global_subsumption_just,[status(thm)],[c_275,c_58,c_275]) ).
cnf(c_287,plain,
( X0 != sk3
| greater(appear(efficient_producers,e),appear(first_movers,X0)) ),
inference(resolution_lifted,[status(thm)],[c_57,c_58]) ).
cnf(c_288,plain,
greater(appear(efficient_producers,e),appear(first_movers,sk3)),
inference(unflattening,[status(thm)],[c_287]) ).
cnf(c_293,plain,
( sk2(sk3) != X0
| first_movers != first_movers
| greater(sk1(X0,first_movers),X0) ),
inference(resolution_lifted,[status(thm)],[c_205,c_249]) ).
cnf(c_294,plain,
greater(sk1(sk2(sk3),first_movers),sk2(sk3)),
inference(unflattening,[status(thm)],[c_293]) ).
cnf(c_298,plain,
( sk2(sk3) != X0
| first_movers != first_movers
| cardinality_at_time(s,t2) = zero ),
inference(resolution_lifted,[status(thm)],[c_196,c_249]) ).
cnf(c_299,plain,
cardinality_at_time(s,t2) = zero,
inference(unflattening,[status(thm)],[c_298]) ).
cnf(c_358,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_531,plain,
( ~ in_environment(sk3,appear(efficient_producers,sk3))
| in_environment(sk3,sk2(sk3)) ),
inference(superposition,[status(thm)],[c_256,c_264]) ).
cnf(c_532,plain,
( ~ in_environment(sk3,appear(first_movers,sk3))
| in_environment(sk3,appear(efficient_producers,e)) ),
inference(superposition,[status(thm)],[c_288,c_264]) ).
cnf(c_535,plain,
in_environment(sk3,appear(efficient_producers,e)),
inference(forward_subsumption_resolution,[status(thm)],[c_532,c_276]) ).
cnf(c_536,plain,
( ~ in_environment(sk3,sk2(sk3))
| in_environment(sk3,sk1(sk2(sk3),first_movers)) ),
inference(superposition,[status(thm)],[c_294,c_264]) ).
cnf(c_549,plain,
( ~ greater(appear(efficient_producers,sk3),X0)
| greater(sk2(sk3),X0) ),
inference(superposition,[status(thm)],[c_256,c_54]) ).
cnf(c_550,plain,
( ~ greater(appear(first_movers,sk3),X0)
| greater(appear(efficient_producers,e),X0) ),
inference(superposition,[status(thm)],[c_288,c_54]) ).
cnf(c_551,plain,
( ~ greater(sk2(sk3),X0)
| greater(sk1(sk2(sk3),first_movers),X0) ),
inference(superposition,[status(thm)],[c_294,c_54]) ).
cnf(c_573,plain,
( ~ greater(sk2(sk3),X0)
| ~ greater(X0,X1)
| greater(sk1(sk2(sk3),first_movers),X1) ),
inference(superposition,[status(thm)],[c_551,c_54]) ).
cnf(c_574,plain,
( ~ greater(sk2(sk3),X0)
| ~ in_environment(sk3,X0)
| in_environment(sk3,sk1(sk2(sk3),first_movers)) ),
inference(superposition,[status(thm)],[c_551,c_264]) ).
cnf(c_592,plain,
( ~ greater(appear(efficient_producers,sk3),X0)
| greater(sk1(sk2(sk3),first_movers),X0) ),
inference(superposition,[status(thm)],[c_256,c_573]) ).
cnf(c_600,plain,
( ~ greater(appear(efficient_producers,sk3),X0)
| ~ greater(X0,X1)
| greater(sk1(sk2(sk3),first_movers),X1) ),
inference(superposition,[status(thm)],[c_592,c_54]) ).
cnf(c_601,plain,
( ~ greater(appear(efficient_producers,sk3),X0)
| ~ in_environment(sk3,X0)
| in_environment(sk3,sk1(sk2(sk3),first_movers)) ),
inference(superposition,[status(thm)],[c_592,c_264]) ).
cnf(c_615,plain,
( ~ in_environment(sk3,appear(efficient_producers,sk3))
| in_environment(sk3,sk1(sk2(sk3),first_movers)) ),
inference(superposition,[status(thm)],[c_256,c_574]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n015.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 : Mon Aug 28 06:43:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.61/1.15 % SZS status Started for theBenchmark.p
% 1.61/1.15 % SZS status Satisfiable for theBenchmark.p
% 1.61/1.15
% 1.61/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.61/1.15
% 1.61/1.15 ------ iProver source info
% 1.61/1.15
% 1.61/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.61/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.61/1.15 git: non_committed_changes: false
% 1.61/1.15 git: last_make_outside_of_git: false
% 1.61/1.15
% 1.61/1.15 ------ Parsing...successful
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.61/1.15
% 1.61/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.61/1.15 ------ Proving...
% 1.61/1.15 ------ Problem Properties
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 clauses 8
% 1.61/1.15 conjectures 1
% 1.61/1.15 EPR 2
% 1.61/1.15 Horn 8
% 1.61/1.15 unary 5
% 1.61/1.15 binary 0
% 1.61/1.15 lits 14
% 1.61/1.15 lits eq 2
% 1.61/1.15 fd_pure 0
% 1.61/1.15 fd_pseudo 0
% 1.61/1.15 fd_cond 0
% 1.61/1.15 fd_pseudo_cond 0
% 1.61/1.15 AC symbols 0
% 1.61/1.15
% 1.61/1.15 ------ Schedule dynamic 5 is on
% 1.61/1.15
% 1.61/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 ------
% 1.61/1.15 Current options:
% 1.61/1.15 ------
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 ------ Proving...
% 1.61/1.15
% 1.61/1.15
% 1.61/1.15 % SZS status Satisfiable for theBenchmark.p
% 1.61/1.15
% 1.61/1.15 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.61/1.15
% 1.61/1.16
%------------------------------------------------------------------------------