TSTP Solution File: MGT041+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.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 : n032.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:37 EDT 2022
% Result : Theorem 0.15s 0.33s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Thu Jun 9 07:56:37 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.32 # No SInE strategy applied
% 0.15/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.32 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.32 #
% 0.15/0.32 # Presaturation interreduction done
% 0.15/0.32 # Number of axioms: 8 Number of unprocessed: 8
% 0.15/0.32 # Tableaux proof search.
% 0.15/0.32 # APR header successfully linked.
% 0.15/0.32 # Hello from C++
% 0.15/0.33 # The folding up rule is enabled...
% 0.15/0.33 # Local unification is enabled...
% 0.15/0.33 # Any saturation attempts will use folding labels...
% 0.15/0.33 # 8 beginning clauses after preprocessing and clausification
% 0.15/0.33 # Creating start rules for all 1 conjectures.
% 0.15/0.33 # There are 1 start rule candidates:
% 0.15/0.33 # Found 4 unit axioms.
% 0.15/0.33 # 1 start rule tableaux created.
% 0.15/0.33 # 4 extension rule candidate clauses
% 0.15/0.33 # 4 unit axiom clauses
% 0.15/0.33
% 0.15/0.33 # Requested 8, 32 cores available to the main process.
% 0.15/0.33 # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.33 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.15/0.33 # There were 0 total branch saturation attempts.
% 0.15/0.33 # There were 0 of these attempts blocked.
% 0.15/0.33 # There were 0 deferred branch saturation attempts.
% 0.15/0.33 # There were 0 free duplicated saturations.
% 0.15/0.33 # There were 0 total successful branch saturations.
% 0.15/0.33 # There were 0 successful branch saturations in interreduction.
% 0.15/0.33 # There were 0 successful branch saturations on the branch.
% 0.15/0.33 # There were 0 successful branch saturations after the branch.
% 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.33 # Begin clausification derivation
% 0.15/0.33
% 0.15/0.33 # End clausification derivation
% 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.33 cnf(i_0_7, hypothesis, (organisation_at_time(esk1_0,esk2_0))).
% 0.15/0.33 cnf(i_0_6, hypothesis, (founding_time(esk1_0,esk2_0))).
% 0.15/0.33 cnf(i_0_5, hypothesis, (number_of_routines(esk1_0,esk2_0,high))).
% 0.15/0.33 cnf(i_0_4, hypothesis, (~has_elaborated_routines(esk1_0,esk2_0))).
% 0.15/0.33 cnf(i_0_8, negated_conjecture, (first_mover(X1)|efficient_producer(X1)|~organisation_at_time(X1,X2))).
% 0.15/0.33 cnf(i_0_2, hypothesis, (has_elaborated_routines(X1,X2)|~founding_time(X1,X2)|~efficient_producer(X1)|~organisation_at_time(X1,X2))).
% 0.15/0.33 cnf(i_0_3, hypothesis, (number_of_routines(X1,X2,low)|~first_mover(X1)|~founding_time(X1,X2)|~organisation_at_time(X1,X2))).
% 0.15/0.33 cnf(i_0_1, plain, (~number_of_routines(X1,X2,low)|~number_of_routines(X1,X2,high))).
% 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.33 # Begin printing tableau
% 0.15/0.33 # Found 11 steps
% 0.15/0.33 cnf(i_0_8, negated_conjecture, (first_mover(esk1_0)|efficient_producer(esk1_0)|~organisation_at_time(esk1_0,esk2_0)), inference(start_rule)).
% 0.15/0.33 cnf(i_0_11, plain, (~organisation_at_time(esk1_0,esk2_0)), inference(closure_rule, [i_0_7])).
% 0.15/0.33 cnf(i_0_9, plain, (first_mover(esk1_0)), inference(extension_rule, [i_0_3])).
% 0.15/0.33 cnf(i_0_18, plain, (~founding_time(esk1_0,esk2_0)), inference(closure_rule, [i_0_6])).
% 0.15/0.33 cnf(i_0_19, plain, (~organisation_at_time(esk1_0,esk2_0)), inference(closure_rule, [i_0_7])).
% 0.15/0.33 cnf(i_0_10, plain, (efficient_producer(esk1_0)), inference(extension_rule, [i_0_2])).
% 0.15/0.33 cnf(i_0_38, plain, (has_elaborated_routines(esk1_0,esk2_0)), inference(closure_rule, [i_0_4])).
% 0.15/0.33 cnf(i_0_39, plain, (~founding_time(esk1_0,esk2_0)), inference(closure_rule, [i_0_6])).
% 0.15/0.33 cnf(i_0_41, plain, (~organisation_at_time(esk1_0,esk2_0)), inference(closure_rule, [i_0_7])).
% 0.15/0.33 cnf(i_0_16, plain, (number_of_routines(esk1_0,esk2_0,low)), inference(extension_rule, [i_0_1])).
% 0.15/0.33 cnf(i_0_73, plain, (~number_of_routines(esk1_0,esk2_0,high)), inference(closure_rule, [i_0_5])).
% 0.15/0.33 # End printing tableau
% 0.15/0.33 # SZS output end
% 0.15/0.33 # Branches closed with saturation will be marked with an "s"
% 0.15/0.33 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.33 # We now have 1 tableaux to operate on
% 0.15/0.33 # Found closed tableau during pool population.
% 0.15/0.33 # Proof search is over...
% 0.15/0.33 # Freeing feature tree
%------------------------------------------------------------------------------