TSTP Solution File: MSC012+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.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 : n015.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:43:16 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.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.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 16:54:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.12/0.35 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35 # Number of axioms: 6 Number of unprocessed: 6
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.35 # The folding up rule is enabled...
% 0.12/0.35 # Local unification is enabled...
% 0.12/0.35 # Any saturation attempts will use folding labels...
% 0.12/0.35 # 6 beginning clauses after preprocessing and clausification
% 0.12/0.35 # Creating start rules for all 1 conjectures.
% 0.12/0.35 # There are 1 start rule candidates:
% 0.12/0.35 # Found 2 unit axioms.
% 0.12/0.35 # 1 start rule tableaux created.
% 0.12/0.35 # 4 extension rule candidate clauses
% 0.12/0.35 # 2 unit axiom clauses
% 0.12/0.35
% 0.12/0.35 # Requested 8, 32 cores available to the main process.
% 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.35 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.35 # There were 1 total branch saturation attempts.
% 0.12/0.35 # There were 0 of these attempts blocked.
% 0.12/0.35 # There were 0 deferred branch saturation attempts.
% 0.12/0.35 # There were 0 free duplicated saturations.
% 0.12/0.35 # There were 1 total successful branch saturations.
% 0.12/0.35 # There were 0 successful branch saturations in interreduction.
% 0.12/0.35 # There were 0 successful branch saturations on the branch.
% 0.12/0.35 # There were 1 successful branch saturations after the branch.
% 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # Begin clausification derivation
% 0.12/0.35
% 0.12/0.35 # End clausification derivation
% 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.35 cnf(i_0_5, plain, (less(X1,esk2_1(X1)))).
% 0.12/0.35 cnf(i_0_6, negated_conjecture, (~goal)).
% 0.12/0.35 cnf(i_0_2, plain, (p(esk1_1(X1))|p(X1))).
% 0.12/0.35 cnf(i_0_1, plain, (~less(X1,X2)|~p(X2)|~p(X1))).
% 0.12/0.35 cnf(i_0_3, plain, (less(X1,esk1_1(X1))|p(X1))).
% 0.12/0.35 cnf(i_0_4, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))).
% 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.35 # Begin printing tableau
% 0.12/0.35 # Found 6 steps
% 0.12/0.35 cnf(i_0_5, plain, (less(X5,esk2_1(X5))), inference(start_rule)).
% 0.12/0.35 cnf(i_0_18, plain, (less(X5,esk2_1(X5))), inference(extension_rule, [i_0_4])).
% 0.12/0.35 cnf(i_0_38, plain, (~less(esk2_1(X5),esk2_1(esk2_1(X5)))), inference(closure_rule, [i_0_5])).
% 0.12/0.35 cnf(i_0_37, plain, (less(X5,esk2_1(esk2_1(X5)))), inference(extension_rule, [i_0_4])).
% 0.12/0.35 cnf(i_0_48, plain, (~less(esk2_1(esk2_1(X5)),esk2_1(esk2_1(esk2_1(X5))))), inference(closure_rule, [i_0_5])).
% 0.12/0.35 cnf(i_0_47, plain, (less(X5,esk2_1(esk2_1(esk2_1(X5))))), inference(etableau_closure_rule, [i_0_47, ...])).
% 0.12/0.35 # End printing tableau
% 0.12/0.35 # SZS output end
% 0.12/0.35 # Branches closed with saturation will be marked with an "s"
% 0.12/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.35 # We now have 8 tableaux to operate on
% 0.12/0.35 # Found closed tableau during pool population.
% 0.12/0.35 # Proof search is over...
% 0.12/0.35 # Freeing feature tree
%------------------------------------------------------------------------------