TSTP Solution File: SYN597-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN597-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 : n016.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:42 EDT 2022
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN597-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/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.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 21:58:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 28 Number of unprocessed: 28
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 28 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 28 conjectures.
% 0.13/0.38 # There are 28 start rule candidates:
% 0.13/0.38 # Found 11 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 28 start rule tableaux created.
% 0.13/0.38 # 17 extension rule candidate clauses
% 0.13/0.38 # 11 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_35, negated_conjecture, (p3(c21,c22))).
% 0.13/0.39 cnf(i_0_34, negated_conjecture, (p16(c21,c22))).
% 0.13/0.39 cnf(i_0_36, negated_conjecture, (p17(c21,f8(c20)))).
% 0.13/0.39 cnf(i_0_37, negated_conjecture, (p16(f5(f6(f7(c19))),f4(c20)))).
% 0.13/0.39 cnf(i_0_29, negated_conjecture, (p10(X1,X1))).
% 0.13/0.39 cnf(i_0_30, negated_conjecture, (p9(X1,X1))).
% 0.13/0.39 cnf(i_0_31, negated_conjecture, (p3(X1,X1))).
% 0.13/0.39 cnf(i_0_32, negated_conjecture, (p2(X1,X1))).
% 0.13/0.39 cnf(i_0_33, negated_conjecture, (p12(X1,X1))).
% 0.13/0.39 cnf(i_0_49, negated_conjecture, (p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)))).
% 0.13/0.39 cnf(i_0_50, negated_conjecture, (~p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)))).
% 0.13/0.39 cnf(i_0_44, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.13/0.39 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p2(X1,X2))).
% 0.13/0.39 cnf(i_0_43, negated_conjecture, (p3(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.13/0.39 cnf(i_0_42, negated_conjecture, (p3(f6(X1),f6(X2))|~p3(X1,X2))).
% 0.13/0.39 cnf(i_0_41, negated_conjecture, (p3(f5(X1),f5(X2))|~p3(X1,X2))).
% 0.13/0.39 cnf(i_0_40, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.13/0.39 cnf(i_0_39, negated_conjecture, (p3(f15(X1),f15(X2))|~p2(X1,X2))).
% 0.13/0.39 cnf(i_0_45, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.13/0.39 cnf(i_0_46, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.13/0.39 cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.13/0.39 cnf(i_0_48, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.13/0.39 cnf(i_0_54, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p3(X1,X3))).
% 0.13/0.39 cnf(i_0_55, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p3(X2,X4)|~p3(X1,X3))).
% 0.13/0.39 cnf(i_0_51, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.13/0.39 cnf(i_0_53, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.13/0.39 cnf(i_0_52, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.13/0.39 cnf(i_0_56, negated_conjecture, (p10(f11(X1,X2,X3),f11(X4,X5,X6))|~p2(X1,X4)|~p9(X2,X5)|~p10(X3,X6))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 10 steps
% 0.13/0.39 cnf(i_0_52, negated_conjecture, (p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))|~p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24))|~p2(c20,c20)|~p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))), inference(start_rule)).
% 0.13/0.39 cnf(i_0_61, plain, (p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))), inference(closure_rule, [i_0_50])).
% 0.13/0.39 cnf(i_0_62, plain, (~p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24))), inference(closure_rule, [i_0_49])).
% 0.13/0.39 cnf(i_0_63, plain, (~p2(c20,c20)), inference(closure_rule, [i_0_32])).
% 0.13/0.39 cnf(i_0_64, plain, (~p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24))), inference(extension_rule, [i_0_56])).
% 0.13/0.39 cnf(i_0_119, plain, (~p9(c23,c23)), inference(closure_rule, [i_0_30])).
% 0.13/0.39 cnf(i_0_120, plain, (~p10(c24,c24)), inference(closure_rule, [i_0_29])).
% 0.13/0.39 cnf(i_0_118, plain, (~p2(f13(f15(c20),f14(f4(c20),c21)),f13(f15(c20),f14(f4(c20),c22)))), inference(extension_rule, [i_0_54])).
% 0.13/0.39 cnf(i_0_138, plain, (~p3(f15(c20),f15(c20))), inference(closure_rule, [i_0_31])).
% 0.13/0.39 cnf(i_0_137, plain, (~p12(f14(f4(c20),c21),f14(f4(c20),c22))), inference(etableau_closure_rule, [i_0_137, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (21608) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------