TSTP Solution File: MGT002-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT002-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 : n018.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:19 EDT 2022
% Result : Unsatisfiable 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT002-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 : n018.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 12:05:53 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: 13 Number of unprocessed: 13
% 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 # 13 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 7 conjectures.
% 0.13/0.36 # There are 7 start rule candidates:
% 0.13/0.36 # Found 7 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 7 start rule tableaux created.
% 0.13/0.36 # 6 extension rule candidate clauses
% 0.13/0.36 # 7 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 7
% 0.13/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 15 tableaux to operate on
% 0.19/0.37 # There were 3 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 3 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 3 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_20, negated_conjecture, (organization(sk2,sk5))).
% 0.19/0.37 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6))).
% 0.19/0.37 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5))).
% 0.19/0.37 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6))).
% 0.19/0.37 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5))).
% 0.19/0.37 cnf(i_0_24, negated_conjecture, (inertia(sk2,sk4,sk6))).
% 0.19/0.37 cnf(i_0_26, negated_conjecture, (~greater(sk4,sk3))).
% 0.19/0.37 cnf(i_0_16, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))).
% 0.19/0.37 cnf(i_0_15, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))).
% 0.19/0.37 cnf(i_0_14, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.19/0.37 cnf(i_0_19, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))).
% 0.19/0.37 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.19/0.37 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 14 steps
% 0.19/0.37 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_31, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_17])).
% 0.19/0.37 cnf(i_0_317, plain, (greater(sk4,sk3)), inference(closure_rule, [i_0_26])).
% 0.19/0.37 cnf(i_0_319, plain, (~inertia(sk2,sk4,sk6)), inference(closure_rule, [i_0_24])).
% 0.19/0.37 cnf(i_0_320, plain, (~inertia(sk2,sk3,sk5)), inference(closure_rule, [i_0_23])).
% 0.19/0.37 cnf(i_0_325, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_326, plain, (~organization(sk2,sk5)), inference(closure_rule, [i_0_20])).
% 0.19/0.37 cnf(i_0_321, plain, (~reorganization_free(sk2,sk6,sk6)), inference(extension_rule, [i_0_16])).
% 0.19/0.37 cnf(i_0_328, plain, (~reorganization_free(sk2,sk5,sk6)), inference(closure_rule, [i_0_22])).
% 0.19/0.37 cnf(i_0_322, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_15])).
% 0.19/0.37 cnf(i_0_330, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_16])).
% 0.19/0.37 cnf(i_0_323, plain, (~reproducibility(sk2,sk6,sk6)), inference(etableau_closure_rule, [i_0_323, ...])).
% 0.19/0.37 cnf(i_0_324, plain, (~reproducibility(sk2,sk5,sk5)), inference(etableau_closure_rule, [i_0_324, ...])).
% 0.19/0.37 cnf(i_0_394, plain, (~reorganization_free(sk2,X7,sk5)), inference(etableau_closure_rule, [i_0_394, ...])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Child (19344) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------