TSTP Solution File: MGT066+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT066+1 : TPTP v8.1.0. Released v2.5.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 : n025.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:46 EDT 2022
% Result : Satisfiable 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT066+1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/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 : n025.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 10:00:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.19/0.36 # and selection function SelectNewComplexAHP.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 11 beginning clauses after preprocessing and clausification
% 0.19/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.19/0.36 # No conjectures.
% 0.19/0.36 # There are 11 start rule candidates:
% 0.19/0.36 # Found 2 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 11 start rule tableaux created.
% 0.19/0.36 # 9 extension rule candidate clauses
% 0.19/0.36 # 2 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # Creating equality axioms
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # 8049 Satisfiable branch
% 0.19/0.36 # Satisfiable branch found.
% 0.19/0.36 # There were 1 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 0.19/0.36 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 0.19/0.36 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.19/0.36 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.19/0.36 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.19/0.36 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.19/0.36 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.19/0.36 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.19/0.36 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.19/0.36 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.19/0.36 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.19/0.36 cnf(i_0_536, plain, (X17=X17)).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 7 steps
% 0.19/0.36 cnf(i_0_536, plain, (X3=X3), inference(start_rule)).
% 0.19/0.36 cnf(i_0_568, plain, (X3=X3), inference(extension_rule, [i_0_541])).
% 0.19/0.36 cnf(i_0_862, plain, ($false), inference(closure_rule, [i_0_536])).
% 0.19/0.36 cnf(i_0_860, plain, (smaller(X3,X3)), inference(extension_rule, [i_0_8])).
% 0.19/0.36 cnf(i_0_871, plain, (greater(X3,X3)), inference(extension_rule, [i_0_9])).
% 0.19/0.36 cnf(i_0_874, plain, (~greater(X3,X3)), inference(closure_rule, [i_0_871])).
% 0.19/0.36 cnf(i_0_863, plain, (~smaller(X3,X3)), inference(extension_rule, [i_0_7])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Creating equality axioms
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # 8046 Satisfiable branch
% 0.19/0.37 # Creating equality axioms
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37 # 8047 Satisfiable branch
% 0.19/0.37 # Child (8049) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------