%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:13:13 PM UTC 2026
% Result : Satisfiable 3.53s 1.30s
% Output : Saturation 3.53s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( greater(sk1(X1,X0),appear(efficient_producers,X0))
| cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth_28) ).
fof(f2,axiom,
! [X0,X1] :
( in_environment(X0,sk1(X1,X0))
| cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth_29) ).
fof(f3,axiom,
! [X0,X1] :
( greater(X1,sk1(X1,X0))
| cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth_30) ).
fof(f4,axiom,
! [X0,X1] :
( greater(zero,growth_rate(efficient_producers,sk1(X1,X0)))
| cardinality_at_time(efficient_producers,X1) != zero
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth_31) ).
fof(f5,axiom,
! [X0,X1] :
( number_of_organizations(X0,X1) = zero
| ~ greater(appear(an_organisation,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_start_of_organizations_32) ).
fof(f6,plain,
! [X0,X1] :
( zero = number_of_organizations(X0,X1)
| ~ greater(appear(an_organisation,X0),X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] :
( subpopulation(sk2(X1,X0),X0,X1)
| decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_decreasing_33) ).
fof(f8,axiom,
! [X0,X1] :
( greater(cardinality_at_time(sk2(X1,X0),X1),zero)
| decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_decreasing_34) ).
fof(f9,axiom,
! [X0,X1] :
( ~ greater(zero,growth_rate(sk2(X1,X0),X1))
| decreases(number_of_organizations(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_decreasing_35) ).
fof(f10,axiom,
! [X2,X0,X1] :
( cardinality_at_time(X2,X1) = zero
| ~ subpopulation(X2,X0,X1)
| number_of_organizations(X0,X1) != zero
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_no_members_36) ).
fof(f11,plain,
! [X2,X0,X1] :
( zero = cardinality_at_time(X2,X1)
| ~ subpopulation(X2,X0,X1)
| zero != number_of_organizations(X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
inference(reorient_equations,[],[f10]) ).
fof(f12,axiom,
! [X0,X1] :
( subpopulation(first_movers,X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations_37) ).
fof(f13,axiom,
! [X0,X1] :
( subpopulation(efficient_producers,X0,X1)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations_38) ).
fof(f14,axiom,
! [X0,X1] :
( ~ greater(zero,growth_rate(X0,X1))
| cardinality_at_time(X0,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_empty_not_decreasing_39) ).
fof(f15,plain,
! [X0,X1] :
( ~ greater(zero,growth_rate(X0,X1))
| zero != cardinality_at_time(X0,X1) ),
inference(reorient_equations,[],[f14]) ).
fof(f16,axiom,
! [X0,X1] :
( greater(cardinality_at_time(efficient_producers,X1),zero)
| cardinality_at_time(efficient_producers,X1) = zero
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_efficient_producers_exist_40) ).
fof(f17,axiom,
! [X0] :
( ~ decreases(X0)
| ~ constant(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_constant_not_decrease_41) ).
fof(f18,axiom,
! [X0,X1] :
( greater(appear(an_organisation,X0),X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_inequality_42) ).
fof(f19,axiom,
! [X0,X1] :
( greater(number_of_organizations(X0,X1),zero)
| ~ greater_or_equal(X1,appear(an_organisation,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1_43) ).
fof(f20,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2_44) ).
fof(f21,axiom,
! [X0,X1] :
( decreases(resources(X0,X1))
| ~ greater(equilibrium(X0),X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_45) ).
fof(f22,axiom,
! [X0,X1] :
( constant(resources(X0,X1))
| greater(equilibrium(X0),X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_46) ).
fof(f23,axiom,
! [X0,X1] :
( ~ decreases(number_of_organizations(X0,X1))
| ~ decreases(resources(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a7_47) ).
fof(f24,axiom,
! [X0,X1] :
( constant(number_of_organizations(X0,X1))
| ~ constant(resources(X0,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a7_48) ).
fof(f25,axiom,
! [X2,X0,X1] :
( X1 = first_movers
| X1 = efficient_producers
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a11_49) ).
fof(f26,plain,
! [X2,X0,X1] :
( first_movers = X1
| efficient_producers = X1
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X0,X2)
| ~ environment(X0) ),
inference(reorient_equations,[],[f25]) ).
fof(f27,axiom,
! [X2,X3,X0,X1] :
( ~ greater(zero,growth_rate(X3,X1))
| ~ greater(resilience(X3),resilience(X2))
| greater(zero,growth_rate(X2,X1))
| ~ in_environment(X0,X1)
| ~ environment(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_50) ).
fof(f28,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6_51) ).
fof(f29,negated_conjecture,
in_environment(sk3,sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6_52) ).
fof(f30,negated_conjecture,
greater_or_equal(sk4,appear(efficient_producers,sk3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6_53) ).
fof(f31,negated_conjecture,
~ greater(cardinality_at_time(efficient_producers,sk4),zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6_54) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( greater(sk1(X0,X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( in_environment(X1,sk1(X0,X1))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( greater(X0,sk1(X0,X1))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(efficient_producers,sk1(X0,X1)))
| ~ environment(X1)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ( cardinality_at_time(efficient_producers,X0) != zero ) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( ( number_of_organizations(X0,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(appear(an_organisation,X0),X1) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| subpopulation(sk2(X1,X0),X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| greater(cardinality_at_time(sk2(X1,X0),X1),zero)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X1,X0))
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater(zero,growth_rate(sk2(X0,X1),X0)) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( cardinality_at_time(X2,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ subpopulation(X2,X0,X1)
| ( number_of_organizations(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( subpopulation(first_movers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( subpopulation(efficient_producers,X0,X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] :
( ~ greater(zero,growth_rate(X0,X1))
| ( cardinality_at_time(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ( cardinality_at_time(efficient_producers,X1) = zero )
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_89,plain,
! [X0: $i] :
( ~ constant(X0)
| ~ decreases(X0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] :
( greater(appear(an_organisation,X1),X0)
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X0,appear(an_organisation,X1)) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( greater(number_of_organizations(X1,X0),zero)
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater_or_equal(X0,appear(an_organisation,X1)) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_92,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i] :
( decreases(resources(X0,X1))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(equilibrium(X0),X1)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] :
( constant(resources(X0,X1))
| greater(equilibrium(X0),X1)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ decreases(resources(X0,X1))
| ~ decreases(number_of_organizations(X0,X1)) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] :
( constant(number_of_organizations(X0,X1))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ constant(resources(X0,X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = first_movers )
| ( X0 = efficient_producers )
| ~ environment(X2)
| ~ subpopulation(X0,X2,X1)
| ~ greater(cardinality_at_time(X0,X1),zero) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X0,X2))
| ~ greater(resilience(X0),resilience(X1)) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_99,negated_conjecture,
environment(sk3),
inference(cnf_transformation,[],[f28]) ).
tcf(c_100,negated_conjecture,
in_environment(sk3,sk4),
inference(cnf_transformation,[],[f29]) ).
tcf(c_101,negated_conjecture,
greater_or_equal(sk4,appear(efficient_producers,sk3)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_102,negated_conjecture,
~ greater(cardinality_at_time(efficient_producers,sk4),zero),
inference(cnf_transformation,[],[f31]) ).
tcf(c_210,plain,
( greater(cardinality_at_time(efficient_producers,sk4),zero)
| ( cardinality_at_time(efficient_producers,sk4) = zero )
| ~ environment(sk3) ),
inference(superposition,[status(thm)],[c_100,c_88]) ).
tcf(c_211,plain,
cardinality_at_time(efficient_producers,sk4) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_210,c_102,c_99]) ).
tcf(c_212,plain,
~ greater(zero,zero),
inference(demodulation,[status(thm)],[c_102,c_211]) ).
tcf(c_213,plain,
~ greater(zero,growth_rate(efficient_producers,sk4)),
inference(superposition,[status(thm)],[c_211,c_87]) ).
tcf(c_246,plain,
! [X0: $i] :
( in_environment(X0,sk1(sk4,X0))
| ~ environment(X0)
| ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_211,c_77]) ).
tcf(c_257,plain,
( in_environment(sk3,sk1(sk4,sk3))
| ~ environment(sk3) ),
inference(superposition,[status(thm)],[c_101,c_246]) ).
tcf(c_258,plain,
in_environment(sk3,sk1(sk4,sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_257,c_99]) ).
tcf(c_259,plain,
( greater(cardinality_at_time(efficient_producers,sk1(sk4,sk3)),zero)
| ( cardinality_at_time(efficient_producers,sk1(sk4,sk3)) = zero )
| ~ environment(sk3) ),
inference(superposition,[status(thm)],[c_258,c_88]) ).
tcf(c_260,plain,
( greater(cardinality_at_time(efficient_producers,sk1(sk4,sk3)),zero)
| ( cardinality_at_time(efficient_producers,sk1(sk4,sk3)) = zero ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_259,c_99]) ).
tcf(c_285,plain,
! [X0: $i] :
( greater(sk4,sk1(sk4,X0))
| ~ environment(X0)
| ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_211,c_78]) ).
tcf(c_320,plain,
! [X0: $i,X1: $i,X2: $i] :
( decreases(number_of_organizations(X1,X0))
| ( sk2(X0,X1) = first_movers )
| ( sk2(X0,X1) = efficient_producers )
| ~ environment(X2)
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ subpopulation(sk2(X0,X1),X2,X0) ),
inference(superposition,[status(thm)],[c_82,c_97]) ).
tcf(c_337,plain,
( greater(sk4,sk1(sk4,sk3))
| ~ environment(sk3) ),
inference(superposition,[status(thm)],[c_101,c_285]) ).
tcf(c_338,plain,
greater(sk4,sk1(sk4,sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_337,c_99]) ).
tcf(c_347,plain,
! [X0: $i] :
( greater(sk1(sk4,X0),appear(efficient_producers,X0))
| ~ environment(X0)
| ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_211,c_76]) ).
tcf(c_366,plain,
! [X0: $i] :
( greater(zero,growth_rate(efficient_producers,sk1(sk4,X0)))
| ~ environment(X0)
| ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_211,c_79]) ).
tcf(c_387,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(first_movers,X0))
| ~ environment(X1)
| ~ in_environment(X1,X0)
| ~ greater(zero,growth_rate(efficient_producers,X0)) ),
inference(superposition,[status(thm)],[c_92,c_98]) ).
tcf(c_401,plain,
! [X0: $i,X1: $i] :
( greater(zero,growth_rate(first_movers,sk1(sk4,X1)))
| ~ environment(X1)
| ~ environment(X0)
| ~ greater_or_equal(sk4,appear(efficient_producers,X1))
| ~ in_environment(X0,sk1(sk4,X1)) ),
inference(superposition,[status(thm)],[c_366,c_387]) ).
tcf(c_418,plain,
( greater(zero,growth_rate(first_movers,sk1(sk4,sk3)))
| ~ environment(sk3)
| ~ greater_or_equal(sk4,appear(efficient_producers,sk3)) ),
inference(superposition,[status(thm)],[c_258,c_401]) ).
tcf(c_419,plain,
greater(zero,growth_rate(first_movers,sk1(sk4,sk3))),
inference(forward_subsumption_resolution,[status(thm)],[c_418,c_99,c_101]) ).
tcf(c_434,plain,
! [X0: $i,X1: $i] :
( decreases(number_of_organizations(X0,X1))
| ( sk2(X1,X0) = first_movers )
| ( sk2(X1,X0) = efficient_producers )
| ~ environment(X0)
| ~ in_environment(X0,X1) ),
inference(superposition,[status(thm)],[c_81,c_320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 01:10:51 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.10/0.41 Running model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.53/1.30 % SZS status Started for theBenchmark.p
% 3.53/1.30 % SZS status Satisfiable for theBenchmark.p
% 3.53/1.30
% 3.53/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.53/1.30
% 3.53/1.30 ------ iProver source info
% 3.53/1.30
% 3.53/1.30 git: date: 2026-07-19 20:42:38 +0200
% 3.53/1.30 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.53/1.30 git: non_committed_changes: false
% 3.53/1.30
% 3.53/1.30 ------ Parsing...successful
% 3.53/1.30
% 3.53/1.30
% 3.53/1.30 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/1.30 ------ Proving...
% 3.53/1.30 ------ Problem Properties
% 3.53/1.30
% 3.53/1.30
% 3.53/1.30 clauses 27
% 3.53/1.30 conjectures 4
% 3.53/1.30 EPR 5
% 3.53/1.30 Horn 22
% 3.53/1.30 unary 5
% 3.53/1.30 binary 2
% 3.53/1.30 lits 92
% 3.53/1.30 lits eq 11
% 3.53/1.30 fd_pure 0
% 3.53/1.30 fd_pseudo 0
% 3.53/1.30 fd_cond 1
% 3.53/1.30 fd_pseudo_cond 0
% 3.53/1.30 AC symbols 0
% 3.53/1.30
% 3.53/1.30 ------ Schedule dynamic 5 is on
% 3.53/1.30
% 3.53/1.30 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.53/1.30
% 3.53/1.30
% 3.53/1.30 ------
% 3.53/1.30 Current options:
% 3.53/1.30 ------
% 3.53/1.30
% 3.53/1.30 ------ Input Options
% 3.53/1.30
% 3.53/1.30 --out_options all
% 3.53/1.30 --tptp_safe_out true
% 3.53/1.30 --problem_path ""
% 3.53/1.30 --include_path ""
% 3.53/1.30 --clausifier res/vclausify_rel
% 3.53/1.30 --clausifier_options --mode clausify -t 101.67 -updr off
% 3.53/1.30 --stdin false
% 3.53/1.30 --proof_out true
% 3.53/1.30 --proof_dot_file ""
% 3.53/1.30 --proof_reduce_dot []
% 3.53/1.30 --suppress_sat_res false
% 3.53/1.30 --suppress_unsat_res true
% 3.53/1.30 --stats_out none
% 3.53/1.30 --stats_mem false
% 3.53/1.30 --theory_stats_out false
% 3.53/1.30
% 3.53/1.30 ------ General Options
% 3.53/1.30
% 3.53/1.30 --fof false
% 3.53/1.30 --time_out_real 305.
% 3.53/1.30 --time_out_virtual -1.
% 3.53/1.30 --rnd_seed 13
% 3.53/1.30 --symbol_type_check false
% 3.53/1.30 --clausify_out false
% 3.53/1.30 --sig_cnt_out false
% 3.53/1.30 --trig_cnt_out false
% 3.53/1.30 --trig_cnt_out_tolerance 1.
% 3.53/1.30 --trig_cnt_out_sk_spl false
% 3.53/1.30 --abstr_cl_out false
% 3.53/1.30
% 3.53/1.30 ------ Interactive Mode
% 3.53/1.30
% 3.53/1.30 --interactive_mode false
% 3.53/1.30 --external_ip_address ""
% 3.53/1.30 --external_port 0
% 3.53/1.30
% 3.53/1.30 ------ Global Options
% 3.53/1.30
% 3.53/1.30 --schedule default
% 3.53/1.30 --add_important_lit false
% 3.53/1.30 --prop_solver_per_cl 500
% 3.53/1.30 --subs_bck_mult 8
% 3.53/1.30 --min_unsat_core false
% 3.53/1.30 --soft_assumptions false
% 3.53/1.30 --soft_lemma_size 3
% 3.53/1.30 --prop_impl_unit_size 0
% 3.53/1.30 --prop_impl_unit []
% 3.53/1.30 --share_sel_clauses true
% 3.53/1.30 --reset_solvers false
% 3.53/1.30 --bc_imp_inh [conj_cone]
% 3.53/1.30 --conj_cone_tolerance 3.
% 3.53/1.30 --extra_neg_conj none
% 3.53/1.30 --large_theory_mode true
% 3.53/1.30 --prolific_symb_bound 200
% 3.53/1.30 --lt_threshold 2000
% 3.53/1.30 --clause_weak_htbl true
% 3.53/1.30 --gc_record_bc_elim false
% 3.53/1.30
% 3.53/1.30 ------ Preprocessing Options
% 3.53/1.30
% 3.53/1.30 --preprocessing_flag false
% 3.53/1.30 --time_out_prep_mult 0.1
% 3.53/1.30 --splitting_mode input
% 3.53/1.30 --splitting_grd true
% 3.53/1.30 --splitting_cvd false
% 3.53/1.30 --splitting_cvd_svl false
% 3.53/1.30 --splitting_nvd 32
% 3.53/1.30 --sub_typing false
% 3.53/1.30 --prep_eq_flat_conj false
% 3.53/1.30 --prep_ineq_split false
% 3.53/1.30 --prep_eq_flat_all_gr false
% 3.53/1.30 --prep_gs_sim true
% 3.53/1.30 --prep_unflatten true
% 3.53/1.30 --prep_res_sim true
% 3.53/1.30 --prep_sup_sim_all true
% 3.53/1.30 --prep_sup_sim_sup false
% 3.53/1.30 --prep_upred true
% 3.53/1.30 --prep_well_definedness true
% 3.53/1.30 --prep_sem_filter exhaustive
% 3.53/1.30 --prep_sem_filter_out false
% 3.53/1.30 --pred_elim true
% 3.53/1.30 --res_sim_input true
% 3.53/1.30 --eq_ax_congr_red true
% 3.53/1.30 --pure_diseq_elim true
% 3.53/1.30 --brand_transform false
% 3.53/1.30 --non_eq_to_eq false
% 3.53/1.30 --prep_eq_proxy false
% 3.53/1.30 --prep_def_merge true
% 3.53/1.30 --prep_def_merge_prop_impl false
% 3.53/1.30 --prep_def_merge_mbd true
% 3.53/1.30 --prep_def_merge_tr_red false
% 3.53/1.30 --prep_def_merge_tr_cl false
% 3.53/1.30 --smt_preprocessing false
% 3.53/1.30 --smt_ac_axioms fast
% 3.53/1.30 --preprocessed_out false
% 3.53/1.30 --preprocessed_stats false
% 3.53/1.31
% 3.53/1.31 ------ Abstraction refinement Options
% 3.53/1.31
% 3.53/1.31 --abstr_ref []
% 3.53/1.31 --abstr_ref_prep false
% 3.53/1.31 --abstr_ref_until_sat false
% 3.53/1.31 --abstr_ref_sig_restrict funpre
% 3.53/1.31 --abstr_ref_af_restrict_to_split_sk false
% 3.53/1.31 --abstr_ref_under []
% 3.53/1.31
% 3.53/1.31 ------ SAT Options
% 3.53/1.31
% 3.53/1.31 --sat_mode false
% 3.53/1.31 --sat_fm_restart_options ""
% 3.53/1.31 --sat_gr_def false
% 3.53/1.31 --sat_epr_types true
% 3.53/1.31 --sat_non_cyclic_types false
% 3.53/1.31 --sat_finite_models false
% 3.53/1.31 --sat_fm_lemmas false
% 3.53/1.31 --sat_fm_prep false
% 3.53/1.31 --sat_fm_uc_incr true
% 3.53/1.31 --sat_out_model pos
% 3.53/1.31 --sat_out_clauses false
% 3.53/1.31
% 3.53/1.31 ------ QBF Options
% 3.53/1.31
% 3.53/1.31 --qbf_mode false
% 3.53/1.31 --qbf_elim_univ false
% 3.53/1.31 --qbf_dom_inst none
% 3.53/1.31 --qbf_dom_pre_inst false
% 3.53/1.31 --qbf_sk_in false
% 3.53/1.31 --qbf_pred_elim true
% 3.53/1.31 --qbf_split 512
% 3.53/1.31
% 3.53/1.31 ------ BMC1 Options
% 3.53/1.31
% 3.53/1.31 --bmc1_incremental false
% 3.53/1.31 --bmc1_axioms reachable_all
% 3.53/1.31 --bmc1_min_bound 0
% 3.53/1.31 --bmc1_max_bound -1
% 3.53/1.31 --bmc1_max_bound_default -1
% 3.53/1.31 --bmc1_symbol_reachability true
% 3.53/1.31 --bmc1_property_lemmas false
% 3.53/1.31 --bmc1_k_induction false
% 3.53/1.31 --bmc1_non_equiv_states false
% 3.53/1.31 --bmc1_deadlock false
% 3.53/1.31 --bmc1_ucm false
% 3.53/1.31 --bmc1_add_unsat_core none
% 3.53/1.31 --bmc1_unsat_core_children false
% 3.53/1.31 --bmc1_unsat_core_extrapolate_axioms false
% 3.53/1.31 --bmc1_out_stat full
% 3.53/1.31 --bmc1_ground_init false
% 3.53/1.31 --bmc1_pre_inst_next_state false
% 3.53/1.31 --bmc1_pre_inst_state false
% 3.53/1.31 --bmc1_pre_inst_reach_state false
% 3.53/1.31 --bmc1_out_unsat_core false
% 3.53/1.31 --bmc1_aig_witness_out false
% 3.53/1.31 --bmc1_verbose false
% 3.53/1.31 --bmc1_dump_clauses_tptp false
% 3.53/1.31 --bmc1_dump_unsat_core_tptp false
% 3.53/1.31 --bmc1_dump_file -
% 3.53/1.31 --bmc1_ucm_expand_uc_limit 128
% 3.53/1.31 --bmc1_ucm_n_expand_iterations 6
% 3.53/1.31 --bmc1_ucm_extend_mode 1
% 3.53/1.31 --bmc1_ucm_init_mode 2
% 3.53/1.31 --bmc1_ucm_cone_mode none
% 3.53/1.31 --bmc1_ucm_reduced_relation_type 0
% 3.53/1.31 --bmc1_ucm_relax_model 4
% 3.53/1.31 --bmc1_ucm_full_tr_after_sat true
% 3.53/1.31 --bmc1_ucm_expand_neg_assumptions false
% 3.53/1.31 --bmc1_ucm_layered_model none
% 3.53/1.31 --bmc1_ucm_max_lemma_size 10
% 3.53/1.31
% 3.53/1.31 ------ AIG Options
% 3.53/1.31
% 3.53/1.31 --aig_mode false
% 3.53/1.31
% 3.53/1.31 ------ Instantiation Options
% 3.53/1.31
% 3.53/1.31 --instantiation_flag true
% 3.53/1.31 --inst_sos_flag false
% 3.53/1.31 --inst_sos_phase true
% 3.53/1.31 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 3.53/1.31 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.53/1.31 --inst_lit_sel_side none
% 3.53/1.31 --inst_solver_per_active 1400
% 3.53/1.31 --inst_solver_calls_frac 1.
% 3.53/1.31 --inst_to_smt_solver true
% 3.53/1.31 --inst_passive_queue_type priority_queues
% 3.53/1.31 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.53/1.31 --inst_passive_queues_freq [25;2]
% 3.53/1.31 --inst_dismatching true
% 3.53/1.31 --inst_eager_unprocessed_to_passive true
% 3.53/1.31 --inst_unprocessed_bound 1000
% 3.53/1.31 --inst_prop_sim_given true
% 3.53/1.31 --inst_prop_sim_new false
% 3.53/1.31 --inst_subs_new false
% 3.53/1.31 --inst_eq_res_simp false
% 3.53/1.31 --inst_subs_given false
% 3.53/1.31 --inst_orphan_elimination true
% 3.53/1.31 --inst_learning_loop_flag true
% 3.53/1.31 --inst_learning_start 3000
% 3.53/1.31 --inst_learning_factor 2
% 3.53/1.31 --inst_start_prop_sim_after_learn 3
% 3.53/1.31 --inst_sel_renew solver
% 3.53/1.31 --inst_lit_activity_flag true
% 3.53/1.31 --inst_restr_to_given false
% 3.53/1.31 --inst_activity_threshold 500
% 3.53/1.31
% 3.53/1.31 ------ Resolution Options
% 3.53/1.31
% 3.53/1.31 --resolution_flag false
% 3.53/1.31 --res_lit_sel adaptive
% 3.53/1.31 --res_lit_sel_side none
% 3.53/1.31 --res_ordering kbo
% 3.53/1.31 --res_to_prop_solver active
% 3.53/1.31 --res_prop_simpl_new false
% 3.53/1.31 --res_prop_simpl_given true
% 3.53/1.31 --res_to_smt_solver true
% 3.53/1.31 --res_passive_queue_type priority_queues
% 3.53/1.31 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.53/1.31 --res_passive_queues_freq [15;5]
% 3.53/1.31 --res_forward_subs full
% 3.53/1.31 --res_backward_subs full
% 3.53/1.31 --res_forward_subs_resolution true
% 3.53/1.31 --res_backward_subs_resolution true
% 3.53/1.31 --res_orphan_elimination true
% 3.53/1.31 --res_time_limit 300.
% 3.53/1.31
% 3.53/1.31 ------ Superposition Options
% 3.53/1.31
% 3.53/1.31 --superposition_flag true
% 3.53/1.31 --sup_passive_queue_type priority_queues
% 3.53/1.31 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 3.53/1.31 --sup_passive_queues_freq [8;1;4;4]
% 3.53/1.31 --twee_lhs_weight 4
% 3.53/1.31 --sup_set_join false
% 3.53/1.31 --sup_set_join_goals true
% 3.53/1.31 --sup_set_join_limit 1000
% 3.53/1.31 --demod_completeness_check fast
% 3.53/1.31 --demod_use_ground true
% 3.53/1.31 --sup_unprocessed_bound 0
% 3.53/1.31 --sup_to_prop_solver passive
% 3.53/1.31 --sup_prop_simpl_new true
% 3.53/1.31 --sup_prop_simpl_given true
% 3.53/1.31 --sup_fun_splitting false
% 3.53/1.31 --sup_iter_deepening 2
% 3.53/1.31 --sup_restarts_mult 12
% 3.53/1.31 --sup_score sim_d_gen
% 3.53/1.31 --sup_share_score_frac 0.2
% 3.53/1.31 --sup_share_max_num_cl 500
% 3.53/1.31 --sup_ordering kbo
% 3.53/1.31 --sup_symb_ordering invfreq
% 3.53/1.31 --sup_term_weight default
% 3.53/1.31
% 3.53/1.31 ------ Superposition Simplification Setup
% 3.53/1.31
% 3.53/1.31 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 3.53/1.31 --sup_full_triv [SMTSimplify;PropSubs]
% 3.53/1.31 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.53/1.31 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.53/1.31 --sup_immed_triv []
% 3.53/1.31 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 3.53/1.31 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 3.53/1.31 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 3.53/1.31 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.53/1.31 --sup_input_triv [Unflattening;SMTSimplify]
% 3.53/1.31 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 3.53/1.31 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 3.53/1.31 --sup_full_fixpoint true
% 3.53/1.31 --sup_main_fixpoint true
% 3.53/1.31 --sup_immed_fixpoint false
% 3.53/1.31 --sup_input_fixpoint true
% 3.53/1.31 --sup_cache_sim none
% 3.53/1.31 --sup_smt_interval 500
% 3.53/1.31 --sup_bw_gjoin_interval 0
% 3.53/1.31
% 3.53/1.31 ------ Combination Options
% 3.53/1.31
% 3.53/1.31 --comb_mode clause_based
% 3.53/1.31 --comb_inst_mult 5
% 3.53/1.31 --comb_res_mult 1
% 3.53/1.31 --comb_sup_mult 8
% 3.53/1.31 --comb_sup_deep_mult 2
% 3.53/1.31
% 3.53/1.31 ------ Debug Options
% 3.53/1.31
% 3.53/1.31 --dbg_backtrace false
% 3.53/1.31 --dbg_dump_prop_clauses false
% 3.53/1.31 --dbg_dump_prop_clauses_file -
% 3.53/1.31 --dbg_out_stat false
% 3.53/1.31 --dbg_just_parse false
% 3.53/1.31
% 3.53/1.31
% 3.53/1.31
% 3.53/1.31
% 3.53/1.31 ------ Proving...
% 3.53/1.31
% 3.53/1.31
% 3.53/1.31 % SZS status Satisfiable for theBenchmark.p
% 3.53/1.31
% 3.53/1.31 % SZS output start Saturation for theBenchmark.p
% See solution above
% 3.53/1.31
% 3.53/1.31
%------------------------------------------------------------------------------