TSTP Solution File: SYN494+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN494+1 : TPTP v8.1.0. Released v2.1.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 : n022.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:11:43 EDT 2022
% Result : CounterSatisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN494+1 : TPTP v8.1.0. Released v2.1.0.
% 0.04/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.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 17:22:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 56 Number of unprocessed: 56
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 56 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 56 conjectures.
% 0.19/0.38 # There are 56 start rule candidates:
% 0.19/0.38 # Found 0 unit axioms.
% 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.38 # 56 start rule tableaux created.
% 0.19/0.38 # 56 extension rule candidate clauses
% 0.19/0.38 # 0 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # 18544 Satisfiable branch
% 0.19/0.39 # Satisfiable branch found.
% 0.19/0.39 # 18548 Satisfiable branch
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 0 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 0 successful branch saturations after the branch.
% 0.19/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_56, negated_conjecture, (ndr1_0|~hskp0)).
% 0.19/0.39 cnf(i_0_52, negated_conjecture, (ndr1_0|~hskp1)).
% 0.19/0.39 cnf(i_0_48, negated_conjecture, (ndr1_0|~hskp2)).
% 0.19/0.39 cnf(i_0_44, negated_conjecture, (ndr1_0|~hskp3)).
% 0.19/0.39 cnf(i_0_40, negated_conjecture, (ndr1_0|~hskp4)).
% 0.19/0.39 cnf(i_0_36, negated_conjecture, (ndr1_0|~hskp5)).
% 0.19/0.39 cnf(i_0_32, negated_conjecture, (ndr1_0|~hskp6)).
% 0.19/0.39 cnf(i_0_28, negated_conjecture, (ndr1_0|~hskp7)).
% 0.19/0.39 cnf(i_0_24, negated_conjecture, (ndr1_0|~hskp8)).
% 0.19/0.39 cnf(i_0_20, negated_conjecture, (ndr1_0|~hskp9)).
% 0.19/0.39 cnf(i_0_16, negated_conjecture, (ndr1_0|~hskp10)).
% 0.19/0.39 cnf(i_0_12, negated_conjecture, (ndr1_0|~hskp11)).
% 0.19/0.39 cnf(i_0_53, negated_conjecture, (~c1_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_51, negated_conjecture, (~hskp1|~c3_1(a53))).
% 0.19/0.39 cnf(i_0_49, negated_conjecture, (~c0_1(a53)|~hskp1)).
% 0.19/0.39 cnf(i_0_45, negated_conjecture, (~hskp2|~c0_1(a58))).
% 0.19/0.39 cnf(i_0_2, negated_conjecture, (hskp9|hskp8|hskp2)).
% 0.19/0.39 cnf(i_0_55, negated_conjecture, (c3_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_42, negated_conjecture, (~hskp3|~c2_1(a50))).
% 0.19/0.39 cnf(i_0_38, negated_conjecture, (~hskp4|~c2_1(a51))).
% 0.19/0.39 cnf(i_0_35, negated_conjecture, (~hskp5|~c3_1(a52))).
% 0.19/0.39 cnf(i_0_31, negated_conjecture, (~hskp6|~c3_1(a54))).
% 0.19/0.39 cnf(i_0_46, negated_conjecture, (c3_1(a58)|~hskp2)).
% 0.19/0.39 cnf(i_0_30, negated_conjecture, (~hskp6|~c2_1(a54))).
% 0.19/0.39 cnf(i_0_27, negated_conjecture, (~hskp7|~c1_1(a55))).
% 0.19/0.39 cnf(i_0_22, negated_conjecture, (~hskp8|~c0_1(a56))).
% 0.19/0.39 cnf(i_0_19, negated_conjecture, (~hskp9|~c2_1(a57))).
% 0.19/0.39 cnf(i_0_26, negated_conjecture, (c3_1(a55)|~hskp7)).
% 0.19/0.39 cnf(i_0_23, negated_conjecture, (c3_1(a56)|~hskp8)).
% 0.19/0.39 cnf(i_0_18, negated_conjecture, (~hskp9|~c1_1(a57))).
% 0.19/0.39 cnf(i_0_14, negated_conjecture, (~hskp10|~c1_1(a59))).
% 0.19/0.39 cnf(i_0_17, negated_conjecture, (c3_1(a57)|~hskp9)).
% 0.19/0.39 cnf(i_0_13, negated_conjecture, (c3_1(a59)|~hskp10)).
% 0.19/0.39 cnf(i_0_9, negated_conjecture, (c3_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_54, negated_conjecture, (c2_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_34, negated_conjecture, (c2_1(a52)|~hskp5)).
% 0.19/0.39 cnf(i_0_25, negated_conjecture, (c2_1(a55)|~hskp7)).
% 0.19/0.39 cnf(i_0_21, negated_conjecture, (c2_1(a56)|~hskp8)).
% 0.19/0.39 cnf(i_0_15, negated_conjecture, (c2_1(a59)|~hskp10)).
% 0.19/0.39 cnf(i_0_11, negated_conjecture, (c2_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_50, negated_conjecture, (c1_1(a53)|~hskp1)).
% 0.19/0.39 cnf(i_0_47, negated_conjecture, (c1_1(a58)|~hskp2)).
% 0.19/0.39 cnf(i_0_43, negated_conjecture, (c1_1(a50)|~hskp3)).
% 0.19/0.39 cnf(i_0_37, negated_conjecture, (c1_1(a51)|~hskp4)).
% 0.19/0.39 cnf(i_0_33, negated_conjecture, (c1_1(a52)|~hskp5)).
% 0.19/0.39 cnf(i_0_29, negated_conjecture, (c1_1(a54)|~hskp6)).
% 0.19/0.39 cnf(i_0_41, negated_conjecture, (c0_1(a50)|~hskp3)).
% 0.19/0.39 cnf(i_0_39, negated_conjecture, (c0_1(a51)|~hskp4)).
% 0.19/0.39 cnf(i_0_10, negated_conjecture, (c0_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_5, negated_conjecture, (hskp5|c0_1(X1)|hskp1|c3_1(X1)|~c2_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_1, negated_conjecture, (hskp11|hskp10|c0_1(X1)|c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_3, negated_conjecture, (hskp7|hskp6|c0_1(X1)|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_8, negated_conjecture, (c0_1(X1)|c3_1(X2)|c3_1(X1)|hskp0|~c1_1(X1)|~c1_1(X2)|~c2_1(X2)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_7, negated_conjecture, (hskp3|c1_1(X1)|c2_1(X2)|c3_1(X1)|~c1_1(X2)|~c2_1(X1)|~c3_1(X2)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_6, negated_conjecture, (hskp4|c0_1(X1)|c0_1(X2)|c1_1(X2)|c2_1(X2)|~c2_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_4, negated_conjecture, (c0_1(X1)|c0_1(X2)|c2_1(X1)|c2_1(X2)|c3_1(X1)|~c0_1(X3)|~c1_1(X2)|~c2_1(X3)|~c3_1(X3)|~ndr1_0)).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 6 steps
% 0.19/0.39 cnf(i_0_8, negated_conjecture, (c0_1(a56)|c3_1(a54)|c3_1(a56)|hskp0|~c1_1(a56)|~c1_1(a54)|~c2_1(a54)|~ndr1_0), inference(start_rule)).
% 0.19/0.39 cnf(i_0_83, plain, (c0_1(a56)), inference(extension_rule, [i_0_22])).
% 0.19/0.39 cnf(i_0_306, plain, (~hskp8), inference(extension_rule, [i_0_2])).
% 0.19/0.39 cnf(i_0_422, plain, (hskp9), inference(extension_rule, [i_0_17])).
% 0.19/0.39 cnf(i_0_424, plain, (hskp2), inference(extension_rule, [i_0_47])).
% 0.19/0.39 cnf(i_0_84, plain, (c3_1(a54)), inference(extension_rule, [i_0_31])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Satisfiable branch found.
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 0 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 0 successful branch saturations after the branch.
% 0.19/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_56, negated_conjecture, (ndr1_0|~hskp0)).
% 0.19/0.39 cnf(i_0_52, negated_conjecture, (ndr1_0|~hskp1)).
% 0.19/0.39 cnf(i_0_48, negated_conjecture, (ndr1_0|~hskp2)).
% 0.19/0.39 cnf(i_0_44, negated_conjecture, (ndr1_0|~hskp3)).
% 0.19/0.39 cnf(i_0_40, negated_conjecture, (ndr1_0|~hskp4)).
% 0.19/0.39 cnf(i_0_36, negated_conjecture, (ndr1_0|~hskp5)).
% 0.19/0.39 cnf(i_0_32, negated_conjecture, (ndr1_0|~hskp6)).
% 0.19/0.39 cnf(i_0_28, negated_conjecture, (ndr1_0|~hskp7)).
% 0.19/0.39 cnf(i_0_24, negated_conjecture, (ndr1_0|~hskp8)).
% 0.19/0.39 cnf(i_0_20, negated_conjecture, (ndr1_0|~hskp9)).
% 0.19/0.39 cnf(i_0_16, negated_conjecture, (ndr1_0|~hskp10)).
% 0.19/0.39 cnf(i_0_12, negated_conjecture, (ndr1_0|~hskp11)).
% 0.19/0.39 cnf(i_0_53, negated_conjecture, (~c1_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_51, negated_conjecture, (~hskp1|~c3_1(a53))).
% 0.19/0.39 cnf(i_0_49, negated_conjecture, (~c0_1(a53)|~hskp1)).
% 0.19/0.39 cnf(i_0_45, negated_conjecture, (~hskp2|~c0_1(a58))).
% 0.19/0.39 cnf(i_0_2, negated_conjecture, (hskp9|hskp8|hskp2)).
% 0.19/0.39 cnf(i_0_55, negated_conjecture, (c3_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_42, negated_conjecture, (~hskp3|~c2_1(a50))).
% 0.19/0.39 cnf(i_0_38, negated_conjecture, (~hskp4|~c2_1(a51))).
% 0.19/0.39 cnf(i_0_35, negated_conjecture, (~hskp5|~c3_1(a52))).
% 0.19/0.39 cnf(i_0_31, negated_conjecture, (~hskp6|~c3_1(a54))).
% 0.19/0.39 cnf(i_0_46, negated_conjecture, (c3_1(a58)|~hskp2)).
% 0.19/0.39 cnf(i_0_30, negated_conjecture, (~hskp6|~c2_1(a54))).
% 0.19/0.39 cnf(i_0_27, negated_conjecture, (~hskp7|~c1_1(a55))).
% 0.19/0.39 cnf(i_0_22, negated_conjecture, (~hskp8|~c0_1(a56))).
% 0.19/0.39 cnf(i_0_19, negated_conjecture, (~hskp9|~c2_1(a57))).
% 0.19/0.39 cnf(i_0_26, negated_conjecture, (c3_1(a55)|~hskp7)).
% 0.19/0.39 cnf(i_0_23, negated_conjecture, (c3_1(a56)|~hskp8)).
% 0.19/0.39 cnf(i_0_18, negated_conjecture, (~hskp9|~c1_1(a57))).
% 0.19/0.39 cnf(i_0_14, negated_conjecture, (~hskp10|~c1_1(a59))).
% 0.19/0.39 cnf(i_0_17, negated_conjecture, (c3_1(a57)|~hskp9)).
% 0.19/0.39 cnf(i_0_13, negated_conjecture, (c3_1(a59)|~hskp10)).
% 0.19/0.39 cnf(i_0_9, negated_conjecture, (c3_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_54, negated_conjecture, (c2_1(a49)|~hskp0)).
% 0.19/0.39 cnf(i_0_34, negated_conjecture, (c2_1(a52)|~hskp5)).
% 0.19/0.39 cnf(i_0_25, negated_conjecture, (c2_1(a55)|~hskp7)).
% 0.19/0.39 cnf(i_0_21, negated_conjecture, (c2_1(a56)|~hskp8)).
% 0.19/0.39 cnf(i_0_15, negated_conjecture, (c2_1(a59)|~hskp10)).
% 0.19/0.39 cnf(i_0_11, negated_conjecture, (c2_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_50, negated_conjecture, (c1_1(a53)|~hskp1)).
% 0.19/0.39 cnf(i_0_47, negated_conjecture, (c1_1(a58)|~hskp2)).
% 0.19/0.39 cnf(i_0_43, negated_conjecture, (c1_1(a50)|~hskp3)).
% 0.19/0.39 cnf(i_0_37, negated_conjecture, (c1_1(a51)|~hskp4)).
% 0.19/0.39 cnf(i_0_33, negated_conjecture, (c1_1(a52)|~hskp5)).
% 0.19/0.39 cnf(i_0_29, negated_conjecture, (c1_1(a54)|~hskp6)).
% 0.19/0.39 cnf(i_0_41, negated_conjecture, (c0_1(a50)|~hskp3)).
% 0.19/0.39 cnf(i_0_39, negated_conjecture, (c0_1(a51)|~hskp4)).
% 0.19/0.39 cnf(i_0_10, negated_conjecture, (c0_1(a60)|~hskp11)).
% 0.19/0.39 cnf(i_0_5, negated_conjecture, (hskp5|c0_1(X1)|hskp1|c3_1(X1)|~c2_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_1, negated_conjecture, (hskp11|hskp10|c0_1(X1)|c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_3, negated_conjecture, (hskp7|hskp6|c0_1(X1)|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_8, negated_conjecture, (c0_1(X1)|c3_1(X2)|c3_1(X1)|hskp0|~c1_1(X1)|~c1_1(X2)|~c2_1(X2)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_7, negated_conjecture, (hskp3|c1_1(X1)|c2_1(X2)|c3_1(X1)|~c1_1(X2)|~c2_1(X1)|~c3_1(X2)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_6, negated_conjecture, (hskp4|c0_1(X1)|c0_1(X2)|c1_1(X2)|c2_1(X2)|~c2_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.19/0.39 cnf(i_0_4, negated_conjecture, (c0_1(X1)|c0_1(X2)|c2_1(X1)|c2_1(X2)|c3_1(X1)|~c0_1(X3)|~c1_1(X2)|~c2_1(X3)|~c3_1(X3)|~ndr1_0)).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 3 steps
% 0.19/0.39 cnf(i_0_10, negated_conjecture, (c0_1(a60)|~hskp11), inference(start_rule)).
% 0.19/0.39 cnf(i_0_109, plain, (c0_1(a60)), inference(extension_rule, [i_0_4])).
% 0.19/0.39 cnf(i_0_208, plain, (c0_1(a56)), inference(extension_rule, [i_0_22])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (18544) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------