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.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 : n029.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 : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT018-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 08:06:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 16 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 13 conjectures.
% 0.20/0.37 # There are 13 start rule candidates:
% 0.20/0.37 # Found 13 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 13 start rule tableaux created.
% 0.20/0.37 # 3 extension rule candidate clauses
% 0.20/0.37 # 13 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.39 # There were 6 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 6 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 5 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox2/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_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, (size(sk2,sk6,sk8))).
% 0.20/0.39 cnf(i_0_30, negated_conjecture, (size(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_22, negated_conjecture, (~organization(sk3,sk10))).
% 0.20/0.39 cnf(i_0_32, negated_conjecture, (~greater(sk9,sk10))).
% 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)|~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.20/0.39 cnf(i_0_19, 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.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_26, negated_conjecture, (reorganization(sk3,sk8,sk10)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_37, plain, (reorganization(sk3,sk8,sk10)), inference(extension_rule, [i_0_19])).
% 0.20/0.39 cnf(i_0_334, plain, (organization(sk3,sk10)), inference(closure_rule, [i_0_22])).
% 0.20/0.39 cnf(i_0_335, plain, (~reorganization_type(sk3,sk4,sk8)), inference(closure_rule, [i_0_28])).
% 0.20/0.39 cnf(i_0_336, plain, (~reorganization_type(sk3,sk4,sk8)), inference(closure_rule, [i_0_28])).
% 0.20/0.39 cnf(i_0_337, plain, (~reorganization(sk3,sk8,sk10)), inference(closure_rule, [i_0_26])).
% 0.20/0.39 cnf(i_0_339, plain, (~greater(sk7,sk6)), inference(closure_rule, [i_0_31])).
% 0.20/0.39 cnf(i_0_340, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_341, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_344, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_345, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_333, plain, (greater(sk10,sk10)), inference(extension_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_348, plain, (greater(sk9,sk10)), inference(closure_rule, [i_0_32])).
% 0.20/0.39 cnf(i_0_352, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_353, plain, (~class(sk3,sk5,sk8)), inference(closure_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_356, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_357, plain, (~organization(sk3,sk8)), inference(closure_rule, [i_0_21])).
% 0.20/0.39 cnf(i_0_342, plain, (~inertia(sk3,sk7,sk8)), inference(etableau_closure_rule, [i_0_342, ...])).
% 0.20/0.39 cnf(i_0_343, plain, (~inertia(sk3,sk6,sk8)), inference(etableau_closure_rule, [i_0_343, ...])).
% 0.20/0.39 cnf(i_0_350, plain, (~size(sk3,sk10,sk8)), inference(etableau_closure_rule, [i_0_350, ...])).
% 0.20/0.39 cnf(i_0_351, plain, (~size(sk3,sk10,sk8)), inference(etableau_closure_rule, [i_0_351, ...])).
% 0.20/0.39 cnf(i_0_354, plain, (~inertia(sk3,sk9,sk8)), inference(etableau_closure_rule, [i_0_354, ...])).
% 0.20/0.39 cnf(i_0_355, plain, (~inertia(sk3,sk10,sk8)), inference(etableau_closure_rule, [i_0_355, ...])).
% 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.39 # Child (5928) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------