TSTP Solution File: MGT015-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT015-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 : n022.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:24 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT015-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:45:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 16 Number of unprocessed: 16
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 16 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 13 conjectures.
% 0.13/0.36 # There are 13 start rule candidates:
% 0.13/0.36 # Found 13 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 13 start rule tableaux created.
% 0.13/0.36 # 3 extension rule candidate clauses
% 0.13/0.36 # 13 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.39 # There were 7 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 1 free duplicated saturations.
% 0.20/0.39 # There were 7 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 6 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_20, negated_conjecture, (organization(sk2,sk8))).
% 0.20/0.39 cnf(i_0_21, negated_conjecture, (organization(sk3,sk8))).
% 0.20/0.39 cnf(i_0_22, negated_conjecture, (organization(sk3,sk10))).
% 0.20/0.39 cnf(i_0_31, negated_conjecture, (greater(sk7,sk6))).
% 0.20/0.39 cnf(i_0_23, negated_conjecture, (class(sk2,sk5,sk8))).
% 0.20/0.39 cnf(i_0_24, negated_conjecture, (class(sk3,sk5,sk8))).
% 0.20/0.39 cnf(i_0_29, negated_conjecture, (complexity(sk2,sk6,sk8))).
% 0.20/0.39 cnf(i_0_30, negated_conjecture, (complexity(sk3,sk7,sk8))).
% 0.20/0.39 cnf(i_0_25, negated_conjecture, (reorganization(sk2,sk8,sk9))).
% 0.20/0.39 cnf(i_0_26, negated_conjecture, (reorganization(sk3,sk8,sk10))).
% 0.20/0.39 cnf(i_0_27, negated_conjecture, (reorganization_type(sk2,sk4,sk8))).
% 0.20/0.39 cnf(i_0_28, negated_conjecture, (reorganization_type(sk3,sk4,sk8))).
% 0.20/0.39 cnf(i_0_32, negated_conjecture, (~greater(sk10,sk9))).
% 0.20/0.39 cnf(i_0_17, plain, (inertia(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.20/0.39 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~complexity(X5,X3,X6)|~complexity(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.20/0.39 cnf(i_0_19, hypothesis, (greater(X1,X2)|~reorganization_type(X3,X4,X5)|~reorganization_type(X6,X4,X5)|~reorganization(X3,X5,X1)|~reorganization(X6,X5,X2)|~greater(X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X5)|~inertia(X3,X7,X5)|~inertia(X6,X8,X5)|~organization(X3,X1)|~organization(X3,X5)|~organization(X6,X5))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 23 steps
% 0.20/0.39 cnf(i_0_30, negated_conjecture, (complexity(sk3,sk7,sk8)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_38, plain, (complexity(sk3,sk7,sk8)), inference(extension_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_273, plain, (greater(sk10,sk9)), inference(closure_rule, [i_0_32])).
% 0.20/0.39 cnf(i_0_275, plain, (~complexity(sk3,sk7,sk8)), inference(closure_rule, [i_0_30])).
% 0.20/0.39 cnf(i_0_277, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_278, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_281, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_282, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_274, plain, (~greater(sk7,sk7)), inference(extension_rule, [i_0_19])).
% 0.20/0.39 cnf(i_0_286, plain, (~reorganization_type(sk3,sk4,sk8)), inference(closure_rule, [i_0_28])).
% 0.20/0.39 cnf(i_0_287, plain, (~reorganization_type(sk3,sk4,sk8)), inference(closure_rule, [i_0_28])).
% 0.20/0.39 cnf(i_0_290, plain, (~greater(sk7,sk6)), inference(closure_rule, [i_0_31])).
% 0.20/0.39 cnf(i_0_291, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_292, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_296, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_297, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_279, plain, (~inertia(sk3,sk10,sk8)), inference(etableau_closure_rule, [i_0_279, ...])).
% 0.20/0.39 cnf(i_0_280, plain, (~inertia(sk3,sk9,sk8)), inference(etableau_closure_rule, [i_0_280, ...])).
% 0.20/0.39 cnf(i_0_288, plain, (~reorganization(sk3,sk8,sk7)), inference(etableau_closure_rule, [i_0_288, ...])).
% 0.20/0.39 cnf(i_0_289, plain, (~reorganization(sk3,sk8,sk7)), inference(etableau_closure_rule, [i_0_289, ...])).
% 0.20/0.39 cnf(i_0_293, plain, (~inertia(sk3,sk7,sk8)), inference(etableau_closure_rule, [i_0_293, ...])).
% 0.20/0.39 cnf(i_0_294, plain, (~inertia(sk3,sk6,sk8)), inference(etableau_closure_rule, [i_0_294, ...])).
% 0.20/0.39 cnf(i_0_295, plain, (~organization(sk3,sk7)), inference(etableau_closure_rule, [i_0_295, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Child (3562) has found a proof.
% 0.20/0.40
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------