TSTP Solution File: SYN604-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN604-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 : n027.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:12:46 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN604-1 : TPTP v8.1.0. Released v2.5.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 : n027.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 : Tue Jul 12 03:52:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 30 Number of unprocessed: 30
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/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 # 30 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 30 conjectures.
% 0.19/0.36 # There are 30 start rule candidates:
% 0.19/0.36 # Found 11 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 30 start rule tableaux created.
% 0.19/0.36 # 19 extension rule candidate clauses
% 0.19/0.36 # 11 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p15(c17,c18))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p16(f10(f11(c21)),f12(X1)))).
% 0.19/0.38 cnf(i_0_47, negated_conjecture, (p16(f4(f6(c18,c22)),f4(f6(c18,X1))))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p14(X1,X1))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,X1))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p5(X1,X1))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p3(f4(f8(X1)),f12(X1)))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(f12(f10(X1)),f10(X1)))).
% 0.19/0.38 cnf(i_0_58, negated_conjecture, (~p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))))).
% 0.19/0.38 cnf(i_0_48, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_49, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.19/0.38 cnf(i_0_50, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.19/0.38 cnf(i_0_59, negated_conjecture, (p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))|~p16(f4(X1),f12(c19)))).
% 0.19/0.38 cnf(i_0_60, negated_conjecture, (p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))|~p16(c19,f4(X1)))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p16(X1,f12(X2))|p16(X2,X1))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(f11(X1),f11(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_51, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_52, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_53, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X1,X3))).
% 0.19/0.38 cnf(i_0_46, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_45, negated_conjecture, (p3(f12(X1),f12(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (p3(f10(X1),f10(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p2(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p2(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_56, negated_conjecture, (p5(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.19/0.38 cnf(i_0_54, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p5(X4,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_57, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.19/0.38 cnf(i_0_55, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 8 steps
% 0.19/0.38 cnf(i_0_57, negated_conjecture, (p2(f6(X12,X13),f6(X12,X13))|~p2(X13,X13)|~p5(X12,X12)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_66, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_35])).
% 0.19/0.38 cnf(i_0_67, plain, (~p5(X12,X12)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_65, plain, (p2(f6(X12,X13),f6(X12,X13))), inference(extension_rule, [i_0_57])).
% 0.19/0.38 cnf(i_0_128, plain, (~p5(X14,X14)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_126, plain, (p2(f6(X14,f6(X12,X13)),f6(X14,f6(X12,X13)))), inference(extension_rule, [i_0_56])).
% 0.19/0.38 cnf(i_0_139, plain, (~p5(X7,X7)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_137, plain, (p5(f7(f6(X14,f6(X12,X13)),X7),f7(f6(X14,f6(X12,X13)),X7))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p15(c17,c18))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p16(f10(f11(c21)),f12(X1)))).
% 0.19/0.38 cnf(i_0_47, negated_conjecture, (p16(f4(f6(c18,c22)),f4(f6(c18,X1))))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p14(X1,X1))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,X1))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p5(X1,X1))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p3(f4(f8(X1)),f12(X1)))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(f12(f10(X1)),f10(X1)))).
% 0.19/0.38 cnf(i_0_58, negated_conjecture, (~p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))))).
% 0.19/0.38 cnf(i_0_48, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_49, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.19/0.38 cnf(i_0_50, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.19/0.38 cnf(i_0_59, negated_conjecture, (p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))|~p16(f4(X1),f12(c19)))).
% 0.19/0.38 cnf(i_0_60, negated_conjecture, (p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))|~p16(c19,f4(X1)))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p16(X1,f12(X2))|p16(X2,X1))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(f11(X1),f11(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_51, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_52, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_53, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X1,X3))).
% 0.19/0.38 cnf(i_0_46, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_45, negated_conjecture, (p3(f12(X1),f12(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (p3(f10(X1),f10(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p2(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p2(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_56, negated_conjecture, (p5(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.19/0.38 cnf(i_0_54, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p5(X4,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_57, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.19/0.38 cnf(i_0_55, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 8 steps
% 0.19/0.38 cnf(i_0_56, negated_conjecture, (p5(f7(X14,X13),f7(X14,X13))|~p2(X14,X14)|~p5(X13,X13)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_73, plain, (~p2(X14,X14)), inference(closure_rule, [i_0_35])).
% 0.19/0.38 cnf(i_0_74, plain, (~p5(X13,X13)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_72, plain, (p5(f7(X14,X13),f7(X14,X13))), inference(extension_rule, [i_0_57])).
% 0.19/0.38 cnf(i_0_127, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_35])).
% 0.19/0.38 cnf(i_0_126, plain, (p2(f6(f7(X14,X13),X10),f6(f7(X14,X13),X10))), inference(extension_rule, [i_0_56])).
% 0.19/0.38 cnf(i_0_139, plain, (~p5(X7,X7)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_137, plain, (p5(f7(f6(f7(X14,X13),X10),X7),f7(f6(f7(X14,X13),X10),X7))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p15(c17,c18))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p16(f10(f11(c21)),f12(X1)))).
% 0.19/0.38 cnf(i_0_47, negated_conjecture, (p16(f4(f6(c18,c22)),f4(f6(c18,X1))))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p14(X1,X1))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,X1))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p5(X1,X1))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p3(f4(f8(X1)),f12(X1)))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(f12(f10(X1)),f10(X1)))).
% 0.19/0.38 cnf(i_0_58, negated_conjecture, (~p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))))).
% 0.19/0.38 cnf(i_0_48, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_49, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.19/0.38 cnf(i_0_50, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.19/0.38 cnf(i_0_59, negated_conjecture, (p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))|~p16(f4(X1),f12(c19)))).
% 0.19/0.38 cnf(i_0_60, negated_conjecture, (p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))|~p16(c19,f4(X1)))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p16(X1,f12(X2))|p16(X2,X1))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(f11(X1),f11(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_51, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_52, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_53, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X1,X3))).
% 0.19/0.38 cnf(i_0_46, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_45, negated_conjecture, (p3(f12(X1),f12(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (p3(f10(X1),f10(X2))|~p9(X1,X2))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p2(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p2(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_56, negated_conjecture, (p5(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.19/0.38 cnf(i_0_54, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p5(X4,X2)|~p14(X3,X1))).
% 0.19/0.38 cnf(i_0_57, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.19/0.38 cnf(i_0_55, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 7 steps
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p2(f13(X11),f13(X11))|~p2(X11,X11)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_76, plain, (~p2(X11,X11)), inference(closure_rule, [i_0_35])).
% 0.19/0.38 cnf(i_0_75, plain, (p2(f13(X11),f13(X11))), inference(extension_rule, [i_0_57])).
% 0.19/0.38 cnf(i_0_128, plain, (~p5(X12,X12)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_126, plain, (p2(f6(X12,f13(X11)),f6(X12,f13(X11)))), inference(extension_rule, [i_0_56])).
% 0.19/0.38 cnf(i_0_139, plain, (~p5(X7,X7)), inference(closure_rule, [i_0_33])).
% 0.19/0.38 cnf(i_0_137, plain, (p5(f7(f6(X12,f13(X11)),X7),f7(f6(X12,f13(X11)),X7))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (26470) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------