TSTP Solution File: MGT018+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT018+1 : 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 : n020.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:25 EDT 2022
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT018+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 12:06:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 16 Number of unprocessed: 16
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 16 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 13 conjectures.
% 0.13/0.38 # There are 13 start rule candidates:
% 0.13/0.38 # Found 13 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 13 start rule tableaux created.
% 0.13/0.38 # 3 extension rule candidate clauses
% 0.13/0.38 # 13 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.40 # There were 6 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 1 free duplicated saturations.
% 0.13/0.40 # There were 6 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 5 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_16, negated_conjecture, (organization(esk2_0,esk8_0))).
% 0.13/0.40 cnf(i_0_15, negated_conjecture, (organization(esk3_0,esk8_0))).
% 0.13/0.40 cnf(i_0_5, negated_conjecture, (greater(esk7_0,esk6_0))).
% 0.13/0.40 cnf(i_0_13, negated_conjecture, (class(esk2_0,esk5_0,esk8_0))).
% 0.13/0.40 cnf(i_0_12, negated_conjecture, (class(esk3_0,esk5_0,esk8_0))).
% 0.13/0.40 cnf(i_0_7, negated_conjecture, (size(esk2_0,esk6_0,esk8_0))).
% 0.13/0.40 cnf(i_0_6, negated_conjecture, (size(esk3_0,esk7_0,esk8_0))).
% 0.13/0.40 cnf(i_0_11, negated_conjecture, (reorganization(esk2_0,esk8_0,esk9_0))).
% 0.13/0.40 cnf(i_0_10, negated_conjecture, (reorganization(esk3_0,esk8_0,esk10_0))).
% 0.13/0.40 cnf(i_0_9, negated_conjecture, (reorganization_type(esk2_0,esk4_0,esk8_0))).
% 0.13/0.40 cnf(i_0_8, negated_conjecture, (reorganization_type(esk3_0,esk4_0,esk8_0))).
% 0.13/0.40 cnf(i_0_14, negated_conjecture, (~organization(esk3_0,esk10_0))).
% 0.13/0.40 cnf(i_0_4, negated_conjecture, (~greater(esk9_0,esk10_0))).
% 0.13/0.40 cnf(i_0_1, plain, (inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))).
% 0.13/0.40 cnf(i_0_2, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~size(X5,X3,X6)|~size(X7,X4,X8)|~class(X5,X9,X6)|~class(X7,X9,X8)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.13/0.40 cnf(i_0_3, hypothesis, (greater(X1,X2)|organization(X3,X2)|~reorganization_type(X3,X4,X5)|~reorganization_type(X6,X4,X5)|~reorganization(X3,X5,X2)|~reorganization(X6,X5,X1)|~greater(X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X5)|~inertia(X3,X7,X5)|~inertia(X6,X8,X5)|~organization(X3,X5)|~organization(X6,X5))).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 23 steps
% 0.13/0.40 cnf(i_0_10, negated_conjecture, (reorganization(esk3_0,esk8_0,esk10_0)), inference(start_rule)).
% 0.13/0.40 cnf(i_0_21, plain, (reorganization(esk3_0,esk8_0,esk10_0)), inference(extension_rule, [i_0_3])).
% 0.13/0.40 cnf(i_0_318, plain, (organization(esk3_0,esk10_0)), inference(closure_rule, [i_0_14])).
% 0.13/0.40 cnf(i_0_319, plain, (~reorganization_type(esk3_0,esk4_0,esk8_0)), inference(closure_rule, [i_0_8])).
% 0.13/0.40 cnf(i_0_320, plain, (~reorganization_type(esk3_0,esk4_0,esk8_0)), inference(closure_rule, [i_0_8])).
% 0.13/0.40 cnf(i_0_321, plain, (~reorganization(esk3_0,esk8_0,esk10_0)), inference(closure_rule, [i_0_10])).
% 0.13/0.40 cnf(i_0_323, plain, (~greater(esk7_0,esk6_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.40 cnf(i_0_324, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])).
% 0.13/0.40 cnf(i_0_325, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])).
% 0.13/0.40 cnf(i_0_328, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_329, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_317, plain, (greater(esk10_0,esk10_0)), inference(extension_rule, [i_0_2])).
% 0.13/0.40 cnf(i_0_332, plain, (greater(esk9_0,esk10_0)), inference(closure_rule, [i_0_4])).
% 0.13/0.40 cnf(i_0_336, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])).
% 0.13/0.40 cnf(i_0_337, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])).
% 0.13/0.40 cnf(i_0_340, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_341, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])).
% 0.13/0.40 cnf(i_0_326, plain, (~inertia(esk3_0,esk7_0,esk8_0)), inference(etableau_closure_rule, [i_0_326, ...])).
% 0.13/0.40 cnf(i_0_327, plain, (~inertia(esk3_0,esk6_0,esk8_0)), inference(etableau_closure_rule, [i_0_327, ...])).
% 0.13/0.40 cnf(i_0_334, plain, (~size(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_334, ...])).
% 0.13/0.40 cnf(i_0_335, plain, (~size(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_335, ...])).
% 0.13/0.40 cnf(i_0_338, plain, (~inertia(esk3_0,esk9_0,esk8_0)), inference(etableau_closure_rule, [i_0_338, ...])).
% 0.13/0.40 cnf(i_0_339, plain, (~inertia(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_339, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (29812) has found a proof.
% 0.13/0.40
% 0.13/0.40 # Proof search is over...
% 0.13/0.40 # Freeing feature tree
%------------------------------------------------------------------------------