TSTP Solution File: MGT040-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT040-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600s
% DateTime : Sun Jul 17 22:10:36 EDT 2022
% Result : Satisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600
% 0.13/0.34 % DateTime : Thu Jun 9 11:09:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 22 Number of unprocessed: 21
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 21 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 4 conjectures.
% 0.13/0.37 # There are 4 start rule candidates:
% 0.13/0.37 # Found 6 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 4 start rule tableaux created.
% 0.13/0.37 # 15 extension rule candidate clauses
% 0.13/0.37 # 6 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 9 tableaux to operate on
% 0.13/0.37 # 21463 Satisfiable branch
% 0.13/0.37 # Satisfiable branch found.
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 0 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 0 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_41, negated_conjecture, (observational_period(sk2))).
% 0.13/0.37 cnf(i_0_42, negated_conjecture, (rapid_change(sk2))).
% 0.13/0.37 cnf(i_0_28, plain, (propagation_strategy(first_movers))).
% 0.13/0.37 cnf(i_0_29, plain, (propagation_strategy(efficient_producers))).
% 0.13/0.37 cnf(i_0_43, negated_conjecture, (~extreme(sk2))).
% 0.13/0.37 cnf(i_0_44, negated_conjecture, (~selection_favors(first_movers,efficient_producers,sk2))).
% 0.13/0.37 cnf(i_0_30, plain, (in_environment(X1,end_time(X1))|~environment(X1))).
% 0.13/0.37 cnf(i_0_36, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.13/0.37 cnf(i_0_27, plain, (extreme(X1)|~empty(X2)|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.13/0.37 cnf(i_0_23, plain, (selection_favors(efficient_producers,first_movers,X1)|environment(sk1(X1))|~observational_period(X1))).
% 0.13/0.37 cnf(i_0_37, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1))).
% 0.13/0.37 cnf(i_0_31, plain, (greater(critical_point(X1),end_time(X1))|in_environment(X1,critical_point(X1))|~environment(X1))).
% 0.13/0.37 cnf(i_0_32, plain, (greater_or_equal(end_time(X1),appear(an_organisation,X1))|empty(X1)|~environment(X1))).
% 0.13/0.37 cnf(i_0_25, plain, (selection_favors(efficient_producers,first_movers,X1)|~selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))|~observational_period(X1))).
% 0.13/0.37 cnf(i_0_24, plain, (in_environment(X1,sk1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1))).
% 0.13/0.37 cnf(i_0_40, hypothesis, (appear(first_movers,X1)=appear(an_organisation,X1)|~in_environment(X1,appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.37 cnf(i_0_26, plain, (~rapid_change(X1)|~in_environment(X2,critical_point(X2))|~in_environment(X1,X2)|~environment(X2)|~observational_period(X1))).
% 0.13/0.37 cnf(i_0_33, plain, (in_environment(X1,appear(an_organisation,X1))|~greater_or_equal(end_time(X1),appear(an_organisation,X1))|~environment(X1))).
% 0.13/0.37 cnf(i_0_38, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(first_movers,X2))|~greater(appear(efficient_producers,X2),X1)|~in_environment(X2,X1)|~environment(X2))).
% 0.13/0.37 cnf(i_0_39, hypothesis, (selection_favors(first_movers,efficient_producers,X1)|~greater_or_equal(X1,appear(efficient_producers,X2))|~greater(critical_point(X2),X1)|~in_environment(X2,critical_point(X2))|~environment(X2))).
% 0.13/0.37 cnf(i_0_34, plain, (in_environment(X1,critical_point(X1))|selection_favors(first_movers,efficient_producers,end_time(X1))|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 3 steps
% 0.13/0.37 cnf(i_0_41, negated_conjecture, (observational_period(sk2)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (observational_period(sk2)), inference(extension_rule, [i_0_24])).
% 0.13/0.37 cnf(i_0_236, plain, (in_environment(sk2,sk1(sk2))), inference(extension_rule, [i_0_37])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 21462 Satisfiable branch
% 0.13/0.37 # Child (21463) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------