TSTP Solution File: SYN084+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN084+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 : n021.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:08:03 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 : n021.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 : Mon Jul 11 12:48:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 31 Number of unprocessed: 8
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 8 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 8 conjectures.
% 0.12/0.36 # There are 8 start rule candidates:
% 0.12/0.36 # Found 1 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 8 start rule tableaux created.
% 0.12/0.36 # 7 extension rule candidate clauses
% 0.12/0.36 # 1 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There were 4 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 4 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 4 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_31, negated_conjecture, (big_p(a))).
% 0.12/0.37 cnf(i_0_5, negated_conjecture, (~big_p(f(f(esk1_0)))|~big_p(f(f(esk2_0))))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (big_p(f(esk1_0))|~big_p(f(f(esk2_0)))|~big_p(esk1_0))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (big_p(f(esk2_0))|~big_p(f(f(esk1_0)))|~big_p(esk2_0))).
% 0.12/0.37 cnf(i_0_18, negated_conjecture, (big_p(f(esk2_0))|big_p(f(esk1_0))|~big_p(esk1_0)|~big_p(esk2_0))).
% 0.12/0.37 cnf(i_0_4, negated_conjecture, (big_p(f(f(X1)))|big_p(f(f(X2)))|big_p(X1)|big_p(X2))).
% 0.12/0.37 cnf(i_0_3, negated_conjecture, (big_p(f(f(X1)))|big_p(f(f(X2)))|big_p(X2)|~big_p(f(X1)))).
% 0.12/0.37 cnf(i_0_1, negated_conjecture, (big_p(f(f(X1)))|big_p(f(f(X2)))|~big_p(f(X2))|~big_p(f(X1)))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 12 steps
% 0.12/0.37 cnf(i_0_5, negated_conjecture, (~big_p(f(f(esk1_0)))|~big_p(f(f(esk2_0)))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_54, plain, (~big_p(f(f(esk1_0)))), inference(extension_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_58, plain, (big_p(f(f(esk1_0)))), inference(closure_rule, [i_0_54])).
% 0.12/0.37 cnf(i_0_59, plain, (~big_p(f(esk1_0))), inference(extension_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_55, plain, (~big_p(f(f(esk2_0)))), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.12/0.37 cnf(i_0_60, plain, (~big_p(f(esk1_0))), inference(etableau_closure_rule, [i_0_60, ...])).
% 0.12/0.37 cnf(i_0_62, plain, (big_p(f(f(f(esk1_0))))), inference(etableau_closure_rule, [i_0_62, ...])).
% 0.12/0.37 cnf(i_0_64, plain, (~big_p(f(f(f(esk1_0))))), inference(extension_rule, [i_0_4])).
% 0.12/0.37 cnf(i_0_130, plain, (big_p(f(f(f(esk1_0))))), inference(closure_rule, [i_0_64])).
% 0.12/0.37 cnf(i_0_131, plain, (big_p(f(esk1_0))), inference(closure_rule, [i_0_59])).
% 0.12/0.37 cnf(i_0_132, plain, (big_p(f(esk1_0))), inference(closure_rule, [i_0_59])).
% 0.12/0.37 cnf(i_0_61, plain, (big_p(f(f(f(f(esk1_0)))))), inference(etableau_closure_rule, [i_0_61, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (20579) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------