TSTP Solution File: SYN726-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN726-1 : TPTP v8.1.0. Released v2.5.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:13:36 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN726-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/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 : n014.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 : Mon Jul 11 22:44:04 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 6 Number of unprocessed: 6
% 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.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 6 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 6 conjectures.
% 0.13/0.36 # There are 6 start rule candidates:
% 0.13/0.36 # Found 2 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 6 start rule tableaux created.
% 0.13/0.36 # 4 extension rule candidate clauses
% 0.13/0.36 # 2 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 6
% 0.13/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 11 tableaux to operate on
% 0.13/0.37 # There were 2 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 2 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 2 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_11, negated_conjecture, (~p(sk1,sk2))).
% 0.13/0.37 cnf(i_0_12, negated_conjecture, (~q(sk3,sk4))).
% 0.13/0.37 cnf(i_0_10, negated_conjecture, (q(X1,X2)|p(X1,X2))).
% 0.13/0.37 cnf(i_0_9, negated_conjecture, (q(X1,X2)|~q(X2,X1))).
% 0.13/0.37 cnf(i_0_7, negated_conjecture, (p(X1,X2)|~p(X3,X2)|~p(X1,X3))).
% 0.13/0.37 cnf(i_0_8, negated_conjecture, (q(X1,X2)|~q(X3,X2)|~q(X1,X3))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 9 steps
% 0.13/0.37 cnf(i_0_12, negated_conjecture, (~q(sk3,sk4)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_23, plain, (~q(sk3,sk4)), inference(extension_rule, [i_0_8])).
% 0.13/0.37 cnf(i_0_76, plain, (~q(sk2,sk4)), inference(extension_rule, [i_0_9])).
% 0.13/0.37 cnf(i_0_82, plain, (~q(sk4,sk2)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_77, plain, (~q(sk3,sk2)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_123, plain, (p(sk3,sk2)), inference(extension_rule, [i_0_7])).
% 0.13/0.37 cnf(i_0_124, plain, (p(sk1,sk2)), inference(closure_rule, [i_0_11])).
% 0.13/0.37 cnf(i_0_87, plain, (p(sk4,sk2)), inference(etableau_closure_rule, [i_0_87, ...])).
% 0.13/0.37 cnf(i_0_126, plain, (~p(sk1,sk3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # There were 2 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 2 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 2 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_11, negated_conjecture, (~p(sk1,sk2))).
% 0.13/0.37 cnf(i_0_12, negated_conjecture, (~q(sk3,sk4))).
% 0.13/0.37 cnf(i_0_10, negated_conjecture, (q(X1,X2)|p(X1,X2))).
% 0.13/0.37 cnf(i_0_9, negated_conjecture, (q(X1,X2)|~q(X2,X1))).
% 0.13/0.37 cnf(i_0_7, negated_conjecture, (p(X1,X2)|~p(X3,X2)|~p(X1,X3))).
% 0.13/0.37 cnf(i_0_8, negated_conjecture, (q(X1,X2)|~q(X3,X2)|~q(X1,X3))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 7 steps
% 0.13/0.37 cnf(i_0_8, negated_conjecture, (q(sk3,sk4)|~q(sk2,sk4)|~q(sk3,sk2)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_13, plain, (q(sk3,sk4)), inference(closure_rule, [i_0_12])).
% 0.13/0.37 cnf(i_0_15, plain, (~q(sk3,sk2)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_44, plain, (p(sk3,sk2)), inference(extension_rule, [i_0_7])).
% 0.13/0.37 cnf(i_0_78, plain, (p(sk1,sk2)), inference(closure_rule, [i_0_11])).
% 0.13/0.37 cnf(i_0_14, plain, (~q(sk2,sk4)), inference(etableau_closure_rule, [i_0_14, ...])).
% 0.13/0.37 cnf(i_0_80, plain, (~p(sk1,sk3)), inference(etableau_closure_rule, [i_0_80, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # There were 2 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 2 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 2 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_11, negated_conjecture, (~p(sk1,sk2))).
% 0.13/0.37 cnf(i_0_12, negated_conjecture, (~q(sk3,sk4))).
% 0.13/0.37 cnf(i_0_10, negated_conjecture, (q(X1,X2)|p(X1,X2))).
% 0.13/0.37 cnf(i_0_9, negated_conjecture, (q(X1,X2)|~q(X2,X1))).
% 0.13/0.37 cnf(i_0_7, negated_conjecture, (p(X1,X2)|~p(X3,X2)|~p(X1,X3))).
% 0.13/0.37 cnf(i_0_8, negated_conjecture, (q(X1,X2)|~q(X3,X2)|~q(X1,X3))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 10 steps
% 0.13/0.37 cnf(i_0_9, negated_conjecture, (q(sk3,sk4)|~q(sk4,sk3)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_19, plain, (q(sk3,sk4)), inference(closure_rule, [i_0_12])).
% 0.13/0.37 cnf(i_0_20, plain, (~q(sk4,sk3)), inference(extension_rule, [i_0_8])).
% 0.13/0.37 cnf(i_0_66, plain, (~q(sk2,sk3)), inference(extension_rule, [i_0_9])).
% 0.13/0.37 cnf(i_0_82, plain, (~q(sk3,sk2)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_67, plain, (~q(sk4,sk2)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_126, plain, (p(sk4,sk2)), inference(extension_rule, [i_0_7])).
% 0.13/0.37 cnf(i_0_130, plain, (p(sk1,sk2)), inference(closure_rule, [i_0_11])).
% 0.13/0.37 cnf(i_0_90, plain, (p(sk3,sk2)), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.13/0.37 cnf(i_0_132, plain, (~p(sk1,sk4)), inference(etableau_closure_rule, [i_0_132, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Child (20233) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------