TSTP Solution File: SYN059-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN059-1 : TPTP v8.1.0. Released v1.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 : n003.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:07:42 EDT 2022
% Result : Satisfiable 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN059-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/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 : n003.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 : Tue Jul 12 04:04:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.13/0.36 # and selection function SelectComplexG.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 32 Number of unprocessed: 32
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 32 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 30 conjectures.
% 0.13/0.37 # There are 30 start rule candidates:
% 0.13/0.37 # Found 2 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 30 start rule tableaux created.
% 0.13/0.37 # 30 extension rule candidate clauses
% 0.13/0.37 # 2 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # 14210 Satisfiable branch
% 0.18/0.37 # Satisfiable branch found.
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 0 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 0 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_33, plain, (big_f(a))).
% 0.18/0.37 cnf(i_0_34, plain, (big_g(b))).
% 0.18/0.37 cnf(i_0_52, negated_conjecture, (big_f(c)|~big_j(f)|~big_h(e))).
% 0.18/0.37 cnf(i_0_58, negated_conjecture, (big_g(d)|~big_j(f)|~big_h(e))).
% 0.18/0.37 cnf(i_0_50, negated_conjecture, (big_f(c)|big_f(e)|~big_j(f))).
% 0.18/0.37 cnf(i_0_56, negated_conjecture, (big_g(d)|big_f(e)|~big_j(f))).
% 0.18/0.37 cnf(i_0_49, negated_conjecture, (big_g(f)|big_f(c)|big_f(e))).
% 0.18/0.37 cnf(i_0_64, negated_conjecture, (~big_j(f)|~big_j(d)|~big_h(e)|~big_h(c))).
% 0.18/0.37 cnf(i_0_51, negated_conjecture, (big_g(f)|big_f(c)|~big_h(e))).
% 0.18/0.37 cnf(i_0_57, negated_conjecture, (big_g(d)|big_g(f)|~big_h(e))).
% 0.18/0.37 cnf(i_0_62, negated_conjecture, (big_f(e)|~big_j(f)|~big_j(d)|~big_h(c))).
% 0.18/0.37 cnf(i_0_55, negated_conjecture, (big_g(d)|big_g(f)|big_f(e))).
% 0.18/0.37 cnf(i_0_61, negated_conjecture, (big_g(f)|big_f(e)|~big_j(d)|~big_h(c))).
% 0.18/0.37 cnf(i_0_63, negated_conjecture, (big_j(d)|big_g(f)|~big_h(e)|~big_h(c))).
% 0.18/0.37 cnf(i_0_38, negated_conjecture, (big_h(X1)|big_f(e)|~big_j(f)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_40, negated_conjecture, (big_h(X1)|~big_j(f)|~big_h(e)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_37, negated_conjecture, (big_h(X1)|big_g(f)|big_f(e)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_43, negated_conjecture, (big_j(X1)|big_g(j)|big_f(e)|~big_g(X1))).
% 0.18/0.37 cnf(i_0_46, negated_conjecture, (big_j(X1)|~big_j(f)|~big_h(e)|~big_g(X1))).
% 0.18/0.37 cnf(i_0_39, negated_conjecture, (big_h(X1)|big_g(f)|~big_h(e)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_44, negated_conjecture, (big_j(X1)|big_f(e)|~big_j(f)|~big_g(X1))).
% 0.18/0.37 cnf(i_0_45, negated_conjecture, (big_j(X1)|big_g(f)|~big_h(e)|~big_g(X1))).
% 0.18/0.37 cnf(i_0_47, negated_conjecture, (big_h(X1)|big_f(c)|~big_g(X2)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_53, negated_conjecture, (big_h(X1)|big_g(d)|~big_g(X2)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_48, negated_conjecture, (big_j(X1)|big_f(c)|~big_g(X1)|~big_f(X2))).
% 0.18/0.37 cnf(i_0_54, negated_conjecture, (big_j(X1)|big_g(d)|~big_g(X1)|~big_f(X2))).
% 0.18/0.37 cnf(i_0_59, negated_conjecture, (big_h(X1)|~big_j(d)|~big_h(c)|~big_g(X2)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_60, negated_conjecture, (big_j(X1)|~big_j(d)|~big_h(c)|~big_g(X1)|~big_f(X2))).
% 0.18/0.37 cnf(i_0_35, negated_conjecture, (big_h(X1)|big_h(X2)|~big_g(X3)|~big_f(X2)|~big_f(X1))).
% 0.18/0.37 cnf(i_0_41, negated_conjecture, (big_j(X1)|big_h(X2)|~big_g(X3)|~big_g(X1)|~big_f(X2))).
% 0.18/0.37 cnf(i_0_36, negated_conjecture, (big_j(X1)|big_h(X2)|~big_g(X1)|~big_f(X3)|~big_f(X2))).
% 0.18/0.37 cnf(i_0_42, negated_conjecture, (big_j(X1)|big_j(X2)|~big_g(X2)|~big_g(X1)|~big_f(X3))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 7 steps
% 0.18/0.37 cnf(i_0_61, negated_conjecture, (big_g(f)|big_f(e)|~big_j(d)|~big_h(c)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_422, plain, (~big_g(d)), inference(closure_rule, [i_0_0])).
% 0.18/0.37 cnf(i_0_423, plain, (~big_f(X6)), inference(closure_rule, [i_0_0])).
% 0.18/0.37 cnf(i_0_147, plain, (big_g(f)), inference(extension_rule, [i_0_42])).
% 0.18/0.37 cnf(i_0_419, plain, (big_j(d)), inference(extension_rule, [i_0_60])).
% 0.18/0.37 cnf(i_0_678, plain, (~big_g(b)), inference(closure_rule, [i_0_34])).
% 0.18/0.37 cnf(i_0_679, plain, (~big_f(a)), inference(closure_rule, [i_0_33])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Child (14210) has found a proof.
% 0.18/0.37
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------