TSTP Solution File: SYN497+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN497+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 : n018.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:45 EDT 2022
% Result : CounterSatisfiable 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN497+1 : TPTP v8.1.0. Released v2.1.0.
% 0.13/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 : n018.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 : Tue Jul 12 05:39:14 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 64 Number of unprocessed: 64
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 64 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 64 conjectures.
% 0.20/0.37 # There are 64 start rule candidates:
% 0.20/0.37 # Found 0 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 64 start rule tableaux created.
% 0.20/0.37 # 64 extension rule candidate clauses
% 0.20/0.37 # 0 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # 26661 Satisfiable branch
% 0.20/0.38 # Satisfiable branch found.
% 0.20/0.38 # There were 1 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 0 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 0 successful branch saturations after the branch.
% 0.20/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp0)).
% 0.20/0.38 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp1)).
% 0.20/0.38 cnf(i_0_56, negated_conjecture, (ndr1_0|~hskp2)).
% 0.20/0.38 cnf(i_0_52, negated_conjecture, (ndr1_0|~hskp3)).
% 0.20/0.38 cnf(i_0_48, negated_conjecture, (ndr1_0|~hskp4)).
% 0.20/0.38 cnf(i_0_44, negated_conjecture, (ndr1_0|~hskp5)).
% 0.20/0.38 cnf(i_0_40, negated_conjecture, (ndr1_0|~hskp6)).
% 0.20/0.38 cnf(i_0_36, negated_conjecture, (ndr1_0|~hskp7)).
% 0.20/0.38 cnf(i_0_32, negated_conjecture, (ndr1_0|~hskp8)).
% 0.20/0.38 cnf(i_0_28, negated_conjecture, (ndr1_0|~hskp9)).
% 0.20/0.38 cnf(i_0_24, negated_conjecture, (ndr1_0|~hskp10)).
% 0.20/0.38 cnf(i_0_20, negated_conjecture, (ndr1_0|~hskp11)).
% 0.20/0.38 cnf(i_0_16, negated_conjecture, (ndr1_0|~hskp12)).
% 0.20/0.38 cnf(i_0_12, negated_conjecture, (ndr1_0|~hskp13)).
% 0.20/0.38 cnf(i_0_63, negated_conjecture, (~c2_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_61, negated_conjecture, (~c1_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_6, negated_conjecture, (hskp8|hskp2|hskp1)).
% 0.20/0.38 cnf(i_0_59, negated_conjecture, (c2_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_57, negated_conjecture, (~c0_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_53, negated_conjecture, (~hskp2|~c2_1(a96))).
% 0.20/0.38 cnf(i_0_51, negated_conjecture, (~hskp3|~c1_1(a97))).
% 0.20/0.38 cnf(i_0_49, negated_conjecture, (~hskp3|~c0_1(a97))).
% 0.20/0.38 cnf(i_0_33, negated_conjecture, (c2_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_46, negated_conjecture, (~hskp4|~c3_1(a102))).
% 0.20/0.38 cnf(i_0_45, negated_conjecture, (~hskp4|~c1_1(a102))).
% 0.20/0.38 cnf(i_0_41, negated_conjecture, (~hskp5|~c2_1(a104))).
% 0.20/0.38 cnf(i_0_39, negated_conjecture, (~hskp6|~c2_1(a91))).
% 0.20/0.38 cnf(i_0_1, negated_conjecture, (hskp13|hskp5|hskp4)).
% 0.20/0.38 cnf(i_0_29, negated_conjecture, (c2_1(a95)|~hskp8)).
% 0.20/0.38 cnf(i_0_38, negated_conjecture, (~hskp6|~c3_1(a91))).
% 0.20/0.38 cnf(i_0_31, negated_conjecture, (~hskp8|~c3_1(a95))).
% 0.20/0.38 cnf(i_0_26, negated_conjecture, (~hskp9|~c2_1(a98))).
% 0.20/0.38 cnf(i_0_27, negated_conjecture, (~hskp9|~c0_1(a98))).
% 0.20/0.38 cnf(i_0_17, negated_conjecture, (c2_1(a100)|~hskp11)).
% 0.20/0.38 cnf(i_0_19, negated_conjecture, (~hskp11|~c0_1(a100))).
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (~hskp12|~c3_1(a101))).
% 0.20/0.38 cnf(i_0_11, negated_conjecture, (c2_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_62, negated_conjecture, (c3_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_54, negated_conjecture, (c3_1(a96)|~hskp2)).
% 0.20/0.38 cnf(i_0_50, negated_conjecture, (c3_1(a97)|~hskp3)).
% 0.20/0.38 cnf(i_0_21, negated_conjecture, (c3_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_18, negated_conjecture, (c3_1(a100)|~hskp11)).
% 0.20/0.38 cnf(i_0_9, negated_conjecture, (c3_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_58, negated_conjecture, (c1_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_55, negated_conjecture, (c1_1(a96)|~hskp2)).
% 0.20/0.38 cnf(i_0_43, negated_conjecture, (c1_1(a104)|~hskp5)).
% 0.20/0.38 cnf(i_0_37, negated_conjecture, (c1_1(a91)|~hskp6)).
% 0.20/0.38 cnf(i_0_34, negated_conjecture, (c1_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_25, negated_conjecture, (c1_1(a98)|~hskp9)).
% 0.20/0.38 cnf(i_0_23, negated_conjecture, (c1_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_14, negated_conjecture, (c1_1(a101)|~hskp12)).
% 0.20/0.38 cnf(i_0_10, negated_conjecture, (c1_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_47, negated_conjecture, (c0_1(a102)|~hskp4)).
% 0.20/0.38 cnf(i_0_42, negated_conjecture, (c0_1(a104)|~hskp5)).
% 0.20/0.38 cnf(i_0_35, negated_conjecture, (c0_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_30, negated_conjecture, (c0_1(a95)|~hskp8)).
% 0.20/0.38 cnf(i_0_22, negated_conjecture, (c0_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_13, negated_conjecture, (c0_1(a101)|~hskp12)).
% 0.20/0.38 cnf(i_0_5, negated_conjecture, (hskp9|hskp3|c2_1(X1)|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_2, negated_conjecture, (hskp12|hskp11|c0_1(X1)|c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_8, negated_conjecture, (hskp7|hskp6|c3_1(X1)|c2_1(X1)|~c0_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_7, negated_conjecture, (c3_1(X1)|c3_1(X2)|hskp0|~c0_1(X2)|~c0_1(X1)|~c1_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_4, negated_conjecture, (hskp10|c3_1(X1)|~c0_1(X2)|~c0_1(X1)|~c1_1(X2)|~c2_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_3, negated_conjecture, (c0_1(X1)|c1_1(X1)|c3_1(X2)|c2_1(X3)|~c0_1(X2)|~c0_1(X3)|~c1_1(X3)|~c2_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 ## 26665 Satisfiable branch
% 0.20/0.38 Found 9 steps
% 0.20/0.38 cnf(i_0_7, negated_conjecture, (c3_1(a101)|c3_1(a95)|hskp0|~c0_1(a95)|~c0_1(a101)|~c1_1(a95)|~c2_1(a101)|~ndr1_0), inference(start_rule)).
% 0.20/0.38 cnf(i_0_83, plain, (c3_1(a101)), inference(extension_rule, [i_0_15])).
% 0.20/0.38 cnf(i_0_315, plain, (~hskp12), inference(extension_rule, [i_0_2])).
% 0.20/0.38 cnf(i_0_350, plain, (hskp11), inference(extension_rule, [i_0_18])).
% 0.20/0.38 cnf(i_0_351, plain, (c0_1(a98)), inference(extension_rule, [i_0_27])).
% 0.20/0.38 cnf(i_0_352, plain, (c2_1(a98)), inference(extension_rule, [i_0_26])).
% 0.20/0.38 cnf(i_0_353, plain, (~c1_1(a98)), inference(extension_rule, [i_0_25])).
% 0.20/0.38 cnf(i_0_354, plain, (~ndr1_0), inference(extension_rule, [i_0_12])).
% 0.20/0.38 cnf(i_0_84, plain, (c3_1(a95)), inference(extension_rule, [i_0_31])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Satisfiable branch found.
% 0.20/0.38 # There were 1 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 0 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 0 successful branch saturations after the branch.
% 0.20/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp0)).
% 0.20/0.38 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp1)).
% 0.20/0.38 cnf(i_0_56, negated_conjecture, (ndr1_0|~hskp2)).
% 0.20/0.38 cnf(i_0_52, negated_conjecture, (ndr1_0|~hskp3)).
% 0.20/0.38 cnf(i_0_48, negated_conjecture, (ndr1_0|~hskp4)).
% 0.20/0.38 cnf(i_0_44, negated_conjecture, (ndr1_0|~hskp5)).
% 0.20/0.38 cnf(i_0_40, negated_conjecture, (ndr1_0|~hskp6)).
% 0.20/0.38 cnf(i_0_36, negated_conjecture, (ndr1_0|~hskp7)).
% 0.20/0.38 cnf(i_0_32, negated_conjecture, (ndr1_0|~hskp8)).
% 0.20/0.38 cnf(i_0_28, negated_conjecture, (ndr1_0|~hskp9)).
% 0.20/0.38 cnf(i_0_24, negated_conjecture, (ndr1_0|~hskp10)).
% 0.20/0.38 cnf(i_0_20, negated_conjecture, (ndr1_0|~hskp11)).
% 0.20/0.38 cnf(i_0_16, negated_conjecture, (ndr1_0|~hskp12)).
% 0.20/0.38 cnf(i_0_12, negated_conjecture, (ndr1_0|~hskp13)).
% 0.20/0.38 cnf(i_0_63, negated_conjecture, (~c2_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_61, negated_conjecture, (~c1_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_6, negated_conjecture, (hskp8|hskp2|hskp1)).
% 0.20/0.38 cnf(i_0_59, negated_conjecture, (c2_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_57, negated_conjecture, (~c0_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_53, negated_conjecture, (~hskp2|~c2_1(a96))).
% 0.20/0.38 cnf(i_0_51, negated_conjecture, (~hskp3|~c1_1(a97))).
% 0.20/0.38 cnf(i_0_49, negated_conjecture, (~hskp3|~c0_1(a97))).
% 0.20/0.38 cnf(i_0_33, negated_conjecture, (c2_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_46, negated_conjecture, (~hskp4|~c3_1(a102))).
% 0.20/0.38 cnf(i_0_45, negated_conjecture, (~hskp4|~c1_1(a102))).
% 0.20/0.38 cnf(i_0_41, negated_conjecture, (~hskp5|~c2_1(a104))).
% 0.20/0.38 cnf(i_0_39, negated_conjecture, (~hskp6|~c2_1(a91))).
% 0.20/0.38 cnf(i_0_1, negated_conjecture, (hskp13|hskp5|hskp4)).
% 0.20/0.38 cnf(i_0_29, negated_conjecture, (c2_1(a95)|~hskp8)).
% 0.20/0.38 cnf(i_0_38, negated_conjecture, (~hskp6|~c3_1(a91))).
% 0.20/0.38 cnf(i_0_31, negated_conjecture, (~hskp8|~c3_1(a95))).
% 0.20/0.38 cnf(i_0_26, negated_conjecture, (~hskp9|~c2_1(a98))).
% 0.20/0.38 cnf(i_0_27, negated_conjecture, (~hskp9|~c0_1(a98))).
% 0.20/0.38 cnf(i_0_17, negated_conjecture, (c2_1(a100)|~hskp11)).
% 0.20/0.38 cnf(i_0_19, negated_conjecture, (~hskp11|~c0_1(a100))).
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (~hskp12|~c3_1(a101))).
% 0.20/0.38 cnf(i_0_11, negated_conjecture, (c2_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_62, negated_conjecture, (c3_1(a93)|~hskp0)).
% 0.20/0.38 cnf(i_0_54, negated_conjecture, (c3_1(a96)|~hskp2)).
% 0.20/0.38 cnf(i_0_50, negated_conjecture, (c3_1(a97)|~hskp3)).
% 0.20/0.38 cnf(i_0_21, negated_conjecture, (c3_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_18, negated_conjecture, (c3_1(a100)|~hskp11)).
% 0.20/0.38 cnf(i_0_9, negated_conjecture, (c3_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_58, negated_conjecture, (c1_1(a94)|~hskp1)).
% 0.20/0.38 cnf(i_0_55, negated_conjecture, (c1_1(a96)|~hskp2)).
% 0.20/0.38 cnf(i_0_43, negated_conjecture, (c1_1(a104)|~hskp5)).
% 0.20/0.38 cnf(i_0_37, negated_conjecture, (c1_1(a91)|~hskp6)).
% 0.20/0.38 cnf(i_0_34, negated_conjecture, (c1_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_25, negated_conjecture, (c1_1(a98)|~hskp9)).
% 0.20/0.38 cnf(i_0_23, negated_conjecture, (c1_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_14, negated_conjecture, (c1_1(a101)|~hskp12)).
% 0.20/0.38 cnf(i_0_10, negated_conjecture, (c1_1(a103)|~hskp13)).
% 0.20/0.38 cnf(i_0_47, negated_conjecture, (c0_1(a102)|~hskp4)).
% 0.20/0.38 cnf(i_0_42, negated_conjecture, (c0_1(a104)|~hskp5)).
% 0.20/0.38 cnf(i_0_35, negated_conjecture, (c0_1(a92)|~hskp7)).
% 0.20/0.38 cnf(i_0_30, negated_conjecture, (c0_1(a95)|~hskp8)).
% 0.20/0.38 cnf(i_0_22, negated_conjecture, (c0_1(a99)|~hskp10)).
% 0.20/0.38 cnf(i_0_13, negated_conjecture, (c0_1(a101)|~hskp12)).
% 0.20/0.38 cnf(i_0_5, negated_conjecture, (hskp9|hskp3|c2_1(X1)|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_2, negated_conjecture, (hskp12|hskp11|c0_1(X1)|c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_8, negated_conjecture, (hskp7|hskp6|c3_1(X1)|c2_1(X1)|~c0_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_7, negated_conjecture, (c3_1(X1)|c3_1(X2)|hskp0|~c0_1(X2)|~c0_1(X1)|~c1_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_4, negated_conjecture, (hskp10|c3_1(X1)|~c0_1(X2)|~c0_1(X1)|~c1_1(X2)|~c2_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 cnf(i_0_3, negated_conjecture, (c0_1(X1)|c1_1(X1)|c3_1(X2)|c2_1(X3)|~c0_1(X2)|~c0_1(X3)|~c1_1(X3)|~c2_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 4 steps
% 0.20/0.38 cnf(i_0_13, negated_conjecture, (c0_1(a101)|~hskp12), inference(start_rule)).
% 0.20/0.38 cnf(i_0_109, plain, (c0_1(a101)), inference(extension_rule, [i_0_3])).
% 0.20/0.38 cnf(i_0_232, plain, (~c0_1(a101)), inference(closure_rule, [i_0_109])).
% 0.20/0.38 cnf(i_0_227, plain, (c0_1(a100)), inference(extension_rule, [i_0_19])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Child (26661) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------