TSTP Solution File: SYN326+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN326+1 : TPTP v8.1.0. Released v2.0.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 : n013.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 : Thu Jul 21 06:09:55 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN326+1 : TPTP v8.1.0. Released v2.0.0.
% 0.13/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Tue Jul 12 08:45:59 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.13/0.39 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.13/0.39 #
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39 # Number of axioms: 7 Number of unprocessed: 7
% 0.13/0.39 # Tableaux proof search.
% 0.13/0.39 # APR header successfully linked.
% 0.13/0.39 # Hello from C++
% 0.13/0.39 # The folding up rule is enabled...
% 0.13/0.39 # Local unification is enabled...
% 0.13/0.39 # Any saturation attempts will use folding labels...
% 0.13/0.39 # 7 beginning clauses after preprocessing and clausification
% 0.13/0.39 # Creating start rules for all 7 conjectures.
% 0.13/0.39 # There are 7 start rule candidates:
% 0.13/0.39 # Found 2 unit axioms.
% 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.39 # 7 start rule tableaux created.
% 0.13/0.39 # 5 extension rule candidate clauses
% 0.13/0.39 # 2 unit axiom clauses
% 0.13/0.39
% 0.13/0.39 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 7
% 0.13/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.39 # We now have 10 tableaux to operate on
% 0.13/0.39 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.13/0.39 # There were 0 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 0 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 0 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_2, negated_conjecture, (big_f(X1,esk1_1(X1)))).
% 0.13/0.39 cnf(i_0_1, negated_conjecture, (~big_f(esk2_1(X1),esk2_1(X1)))).
% 0.13/0.39 cnf(i_0_3, negated_conjecture, (big_h(esk2_1(X1))|~big_g(X1))).
% 0.13/0.39 cnf(i_0_5, negated_conjecture, (big_f(X1,X1)|~big_h(X1))).
% 0.13/0.39 cnf(i_0_6, negated_conjecture, (big_g(esk1_1(X1))|big_f(X1,X1))).
% 0.13/0.39 cnf(i_0_4, negated_conjecture, (big_h(esk2_1(X1))|big_f(esk2_1(X1),X1))).
% 0.13/0.39 cnf(i_0_7, negated_conjecture, (big_f(esk1_1(X1),esk2_1(X1))|big_f(X1,X1))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_6, negated_conjecture, (big_g(esk1_1(esk2_1(X2)))|big_f(esk2_1(X2),esk2_1(X2))), inference(start_rule)).
% 0.13/0.39 cnf(i_0_13, plain, (big_f(esk2_1(X2),esk2_1(X2))), inference(closure_rule, [i_0_1])).
% 0.13/0.39 cnf(i_0_12, plain, (big_g(esk1_1(esk2_1(X2)))), inference(extension_rule, [i_0_3])).
% 0.13/0.39 cnf(i_0_58, plain, (big_h(esk2_1(esk1_1(esk2_1(X2))))), inference(extension_rule, [i_0_5])).
% 0.13/0.39 cnf(i_0_116, plain, (big_f(esk2_1(esk1_1(esk2_1(X2))),esk2_1(esk1_1(esk2_1(X2))))), inference(closure_rule, [i_0_1])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (9190) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------