TSTP Solution File: MGT045+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT045+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:38 EDT 2022
% Result : Theorem 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT045+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 9 11:51:19 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.35 #
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35 # Number of axioms: 17 Number of unprocessed: 17
% 0.11/0.35 # Tableaux proof search.
% 0.11/0.35 # APR header successfully linked.
% 0.11/0.35 # Hello from C++
% 0.11/0.35 # The folding up rule is enabled...
% 0.11/0.35 # Local unification is enabled...
% 0.11/0.35 # Any saturation attempts will use folding labels...
% 0.11/0.35 # 17 beginning clauses after preprocessing and clausification
% 0.11/0.35 # Creating start rules for all 3 conjectures.
% 0.11/0.35 # There are 3 start rule candidates:
% 0.11/0.35 # Found 5 unit axioms.
% 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.35 # 3 start rule tableaux created.
% 0.11/0.35 # 12 extension rule candidate clauses
% 0.11/0.35 # 5 unit axiom clauses
% 0.11/0.35
% 0.11/0.35 # Requested 8, 32 cores available to the main process.
% 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 3
% 0.11/0.35 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.35 # We now have 13 tableaux to operate on
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_17, negated_conjecture, (organization(esk1_0))).
% 0.11/0.36 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))).
% 0.11/0.36 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 0.11/0.36 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 0.11/0.36 cnf(i_0_15, negated_conjecture, (~greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)))).
% 0.11/0.36 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.11/0.36 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.11/0.36 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.11/0.36 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.11/0.36 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.11/0.36 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.11/0.36 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.11/0.36 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.11/0.36 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.11/0.36 cnf(i_0_12, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))).
% 0.11/0.36 cnf(i_0_14, plain, (greater(external_ties(X1,X2),external_ties(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))).
% 0.11/0.36 cnf(i_0_13, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 5 steps
% 0.11/0.36 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(start_rule)).
% 0.11/0.36 cnf(i_0_21, plain, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(extension_rule, [i_0_14])).
% 0.11/0.36 cnf(i_0_80, plain, (~organization(esk1_0)), inference(closure_rule, [i_0_17])).
% 0.11/0.36 cnf(i_0_79, plain, (greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))), inference(extension_rule, [i_0_9])).
% 0.11/0.36 cnf(i_0_86, plain, (~greater(external_ties(esk1_0,esk2_0),external_ties(esk1_0,esk3_0))), inference(etableau_closure_rule, [i_0_86, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # Child (16233) has found a proof.
% 0.11/0.36
% 0.11/0.36 # Proof search is over...
% 0.11/0.36 # Freeing feature tree
%------------------------------------------------------------------------------