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 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 : n014.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 : Satisfiable 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN084-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 : n014.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 13:14:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.19/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 13 Number of unprocessed: 6
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 6 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 6 conjectures.
% 0.19/0.36 # There are 6 start rule candidates:
% 0.19/0.36 # Found 1 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 6 start rule tableaux created.
% 0.19/0.36 # 5 extension rule candidate clauses
% 0.19/0.36 # 1 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 6
% 0.19/0.36 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 14 tableaux to operate on
% 0.19/0.36 # 22069 Satisfiable branch
% 0.19/0.36 # 22067 Satisfiable branch
% 0.19/0.36 # Satisfiable branch found.
% 0.19/0.36 # There were 1 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_14, negated_conjecture, (big_p(a))).
% 0.19/0.36 cnf(i_0_26, negated_conjecture, (big_p(f(b))|~big_p(f(X1))|~big_p(b))).
% 0.19/0.36 cnf(i_0_25, negated_conjecture, (big_p(f(b))|big_p(X1)|~big_p(b))).
% 0.19/0.36 cnf(i_0_22, negated_conjecture, (big_p(f(f(X1)))|~big_p(f(X1))|~big_p(f(X2)))).
% 0.19/0.36 cnf(i_0_15, negated_conjecture, (big_p(f(f(X1)))|big_p(X1))).
% 0.19/0.36 cnf(i_0_21, negated_conjecture, (big_p(f(f(X1)))|big_p(X2)|~big_p(f(X1)))).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 11 steps
% 0.19/0.36 cnf(i_0_26, negated_conjecture, (big_p(f(b))|~big_p(f(f(b)))|~big_p(b)), inference(start_rule)).
% 0.19/0.36 cnf(i_0_38, plain, (big_p(f(b))), inference(extension_rule, [i_0_21])).
% 0.19/0.36 cnf(i_0_70, plain, (big_p(f(f(b)))), inference(extension_rule, [i_0_22])).
% 0.19/0.36 cnf(i_0_77, plain, (~big_p(f(f(b)))), inference(closure_rule, [i_0_70])).
% 0.19/0.36 cnf(i_0_75, plain, (big_p(f(f(f(b))))), inference(extension_rule, [i_0_21])).
% 0.19/0.36 cnf(i_0_71, plain, (big_p(f(X3))), inference(extension_rule, [i_0_22])).
% 0.19/0.36 cnf(i_0_99, plain, (~big_p(f(X3))), inference(closure_rule, [i_0_71])).
% 0.19/0.36 cnf(i_0_97, plain, (big_p(f(f(X3)))), inference(extension_rule, [i_0_21])).
% 0.19/0.36 cnf(i_0_39, plain, (~big_p(f(f(b)))), inference(extension_rule, [i_0_15])).
% 0.19/0.36 cnf(i_0_112, plain, (big_p(b)), inference(extension_rule, [i_0_25])).
% 0.19/0.36 cnf(i_0_114, plain, (big_p(f(f(b)))), inference(closure_rule, [i_0_39])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Satisfiable branch found.
% 0.19/0.36 # There were 1 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.36 # 22071 Satisfiable branch
% 0.19/0.36 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_14, negated_conjecture, (big_p(a))).
% 0.19/0.36 cnf(i_0_26, negated_conjecture, (big_p(f(b))|~big_p(f(X1))|~big_p(b))).
% 0.19/0.36 cnf(i_0_25, negated_conjecture, (big_p(f(b))|big_p(X1)|~big_p(b))).
% 0.19/0.36 cnf(i_0_22, negated_conjecture, (big_p(f(f(X1)))|~big_p(f(X1))|~big_p(f(X2)))).
% 0.19/0.36 cnf(i_0_15, negated_conjecture, (big_p(f(f(X1)))|big_p(X1))).
% 0.19/0.36 cnf(i_0_21, negated_conjecture, (big_p(f(f(X1)))|big_p(X2)|~big_p(f(X1)))).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 16 steps
% 0.19/0.36 cnf(i_0_22, negated_conjecture, (big_p(f(f(f(b))))|~big_p(f(f(b)))|~big_p(f(f(b)))), inference(start_rule)).
% 0.19/0.36 cnf(i_0_32, plain, (big_p(f(f(f(b))))), inference(extension_rule, [i_0_21])).
% 0.19/0.36 cnf(i_0_70, plain, (big_p(f(f(f(f(b)))))), inference(extension_rule, [i_0_22])).
% 0.19/0.36 cnf(i_0_77, plain, (~big_p(f(f(f(f(b)))))), inference(closure_rule, [i_0_70])).
% 0.19/0.36 cnf(i_0_75, plain, (big_p(f(f(f(f(f(b))))))), inference(extension_rule, [i_0_26])).
% 0.19/0.36 cnf(i_0_71, plain, (big_p(f(X3))), inference(extension_rule, [i_0_26])).
% 0.19/0.36 cnf(i_0_129, plain, (big_p(f(b))), inference(extension_rule, [i_0_22])).
% 0.19/0.36 cnf(i_0_136, plain, (~big_p(f(b))), inference(closure_rule, [i_0_129])).
% 0.19/0.36 cnf(i_0_131, plain, (~big_p(b)), inference(extension_rule, [i_0_15])).
% 0.19/0.36 cnf(i_0_33, plain, (~big_p(f(f(b)))), inference(extension_rule, [i_0_25])).
% 0.19/0.36 cnf(i_0_141, plain, (~big_p(b)), inference(extension_rule, [i_0_15])).
% 0.19/0.36 cnf(i_0_151, plain, (big_p(f(f(b)))), inference(closure_rule, [i_0_33])).
% 0.19/0.36 cnf(i_0_139, plain, (big_p(f(b))), inference(extension_rule, [i_0_22])).
% 0.19/0.36 cnf(i_0_159, plain, (big_p(f(f(b)))), inference(closure_rule, [i_0_33])).
% 0.19/0.36 cnf(i_0_160, plain, (~big_p(f(b))), inference(closure_rule, [i_0_139])).
% 0.19/0.36 cnf(i_0_34, plain, (~big_p(f(f(b)))), inference(closure_rule, [i_0_33])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Satisfiable branch found.
% 0.19/0.36 # There were 1 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # Child (22069) has found a proof.
% 0.19/0.37
% 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_14, negated_conjecture, (big_p(a))).
% 0.19/0.37 cnf(i_0_26, negated_conjecture, (big_p(f(b))|~big_p(f(X1))|~big_p(b))).
% 0.19/0.37 cnf(i_0_25, negated_conjecture, (big_p(f(b))|big_p(X1)|~big_p(b))).
% 0.19/0.37 cnf(i_0_22, negated_conjecture, (big_p(f(f(X1)))|~big_p(f(X1))|~big_p(f(X2)))).
% 0.19/0.37 cnf(i_0_15, negated_conjecture, (big_p(f(f(X1)))|big_p(X1))).
% 0.19/0.37 cnf(i_0_21, negated_conjecture, (big_p(f(f(X1)))|big_p(X2)|~big_p(f(X1)))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 16 steps
% 0.19/0.37 cnf(i_0_21, negated_conjecture, (big_p(f(f(f(b))))|big_p(b)|~big_p(f(f(b)))), inference(start_rule)).
% 0.19/0.37 cnf(i_0_28, plain, (big_p(b)), inference(extension_rule, [i_0_26])).
% 0.19/0.37 cnf(i_0_67, plain, (big_p(f(b))), inference(extension_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_70, plain, (big_p(f(f(b)))), inference(extension_rule, [i_0_22])).
% 0.19/0.37 cnf(i_0_77, plain, (~big_p(f(f(b)))), inference(closure_rule, [i_0_70])).
% 0.19/0.37 cnf(i_0_71, plain, (big_p(f(X4))), inference(extension_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_68, plain, (~big_p(f(f(f(f(X7)))))), inference(extension_rule, [i_0_15])).
% 0.19/0.37 cnf(i_0_90, plain, (big_p(f(f(X7)))), inference(closure_rule, [i_0_68])).
% 0.19/0.37 cnf(i_0_27, plain, (big_p(f(f(f(b))))), inference(extension_rule, [i_0_22])).
% 0.19/0.37 cnf(i_0_99, plain, (~big_p(f(f(f(b))))), inference(closure_rule, [i_0_27])).
% 0.19/0.37 cnf(i_0_97, plain, (big_p(f(f(f(f(b)))))), inference(extension_rule, [i_0_26])).
% 0.19/0.37 cnf(i_0_103, plain, (big_p(f(b))), inference(extension_rule, [i_0_21])).
% 0.19/0.37 cnf(i_0_105, plain, (~big_p(b)), inference(extension_rule, [i_0_15])).
% 0.19/0.37 cnf(i_0_29, plain, (~big_p(f(f(b)))), inference(extension_rule, [i_0_22])).
% 0.19/0.37 cnf(i_0_121, plain, (~big_p(f(b))), inference(extension_rule, [i_0_25])).
% 0.19/0.37 cnf(i_0_124, plain, (big_p(f(b))), inference(closure_rule, [i_0_121])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------