TSTP Solution File: SYN648-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN648-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:03 EDT 2022
% Result : Unsatisfiable 0.22s 0.43s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN648-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jul 12 06:34:49 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.22/0.39 #
% 0.22/0.39 # Presaturation interreduction done
% 0.22/0.39 # Number of axioms: 44 Number of unprocessed: 44
% 0.22/0.39 # Tableaux proof search.
% 0.22/0.39 # APR header successfully linked.
% 0.22/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 44 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 44 conjectures.
% 0.22/0.39 # There are 44 start rule candidates:
% 0.22/0.39 # Found 16 unit axioms.
% 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.39 # 44 start rule tableaux created.
% 0.22/0.39 # 28 extension rule candidate clauses
% 0.22/0.39 # 16 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.43 # There were 4 total branch saturation attempts.
% 0.22/0.43 # There were 0 of these attempts blocked.
% 0.22/0.43 # There were 0 deferred branch saturation attempts.
% 0.22/0.43 # There were 0 free duplicated saturations.
% 0.22/0.43 # There were 4 total successful branch saturations.
% 0.22/0.43 # There were 0 successful branch saturations in interreduction.
% 0.22/0.43 # There were 0 successful branch saturations on the branch.
% 0.22/0.43 # There were 4 successful branch saturations after the branch.
% 0.22/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.43 # Begin clausification derivation
% 0.22/0.43
% 0.22/0.43 # End clausification derivation
% 0.22/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.43 cnf(i_0_58, negated_conjecture, (p2(c27,c30))).
% 0.22/0.43 cnf(i_0_59, negated_conjecture, (p26(c31,c30))).
% 0.22/0.43 cnf(i_0_45, negated_conjecture, (p10(X1,X1))).
% 0.22/0.43 cnf(i_0_46, negated_conjecture, (p8(X1,X1))).
% 0.22/0.43 cnf(i_0_47, negated_conjecture, (p7(X1,X1))).
% 0.22/0.43 cnf(i_0_48, negated_conjecture, (p5(X1,X1))).
% 0.22/0.43 cnf(i_0_49, negated_conjecture, (p3(X1,X1))).
% 0.22/0.43 cnf(i_0_50, negated_conjecture, (p25(X1,X1))).
% 0.22/0.43 cnf(i_0_51, negated_conjecture, (p22(X1,X1))).
% 0.22/0.43 cnf(i_0_52, negated_conjecture, (p20(X1,X1))).
% 0.22/0.43 cnf(i_0_53, negated_conjecture, (p2(X1,X1))).
% 0.22/0.43 cnf(i_0_54, negated_conjecture, (p18(X1,X1))).
% 0.22/0.43 cnf(i_0_55, negated_conjecture, (p16(X1,X1))).
% 0.22/0.43 cnf(i_0_56, negated_conjecture, (p14(X1,X1))).
% 0.22/0.43 cnf(i_0_57, negated_conjecture, (p12(X1,X1))).
% 0.22/0.43 cnf(i_0_60, negated_conjecture, (~p24(f4(c27,c28),c29))).
% 0.22/0.43 cnf(i_0_61, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.22/0.43 cnf(i_0_74, negated_conjecture, (p24(f4(c30,X1),X2)|~p24(f4(f6(c32,c30),X1),X2))).
% 0.22/0.43 cnf(i_0_62, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.22/0.43 cnf(i_0_63, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.22/0.43 cnf(i_0_64, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.22/0.43 cnf(i_0_65, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.22/0.43 cnf(i_0_66, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.22/0.43 cnf(i_0_67, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))).
% 0.22/0.43 cnf(i_0_68, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))).
% 0.22/0.43 cnf(i_0_69, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.22/0.43 cnf(i_0_70, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.22/0.43 cnf(i_0_71, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))).
% 0.22/0.43 cnf(i_0_72, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.22/0.43 cnf(i_0_73, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.22/0.43 cnf(i_0_76, negated_conjecture, (p26(X1,X2)|~p26(X3,X4)|~p2(X4,X2)|~p25(X3,X1))).
% 0.22/0.43 cnf(i_0_75, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p3(X3,X1)|~p8(X4,X2))).
% 0.22/0.43 cnf(i_0_78, negated_conjecture, (p10(f13(X1,X2),f13(X3,X4))|~p12(X1,X3)|~p3(X2,X4))).
% 0.22/0.43 cnf(i_0_77, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p7(X1,X3))).
% 0.22/0.43 cnf(i_0_86, negated_conjecture, (p7(f11(X1,X2),f11(X3,X4))|~p2(X2,X4)|~p10(X1,X3))).
% 0.22/0.43 cnf(i_0_85, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.22/0.43 cnf(i_0_84, negated_conjecture, (p3(f17(X1,X2),f17(X3,X4))|~p16(X1,X3)|~p2(X2,X4))).
% 0.22/0.43 cnf(i_0_83, negated_conjecture, (p20(f23(X1,X2),f23(X3,X4))|~p22(X1,X3)|~p3(X2,X4))).
% 0.22/0.43 cnf(i_0_82, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.22/0.43 cnf(i_0_81, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p3(X2,X4))).
% 0.22/0.43 cnf(i_0_80, negated_conjecture, (p16(f19(X1,X2),f19(X3,X4))|~p18(X1,X3)|~p2(X2,X4))).
% 0.22/0.43 cnf(i_0_79, negated_conjecture, (p12(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p3(X2,X4))).
% 0.22/0.43 cnf(i_0_87, negated_conjecture, (p24(X1,c29)|~p24(f4(X2,f17(f19(f21(f23(c33,X1),X3),X4),X2)),f9(f11(f13(f15(c34,X1),X3),X4),X2))|~p26(c31,X2)|~p2(X4,X2)|~p3(X3,f4(X4,c28))|~p3(X1,X3))).
% 0.22/0.43 cnf(i_0_88, negated_conjecture, (p24(f4(f6(c32,X1),f17(f19(f21(f23(c33,X2),X3),X4),X1)),f9(f11(f13(f15(c34,X2),X3),X4),X1))|p24(X2,c29)|~p26(c31,X1)|~p2(X4,X1)|~p3(X3,f4(X4,c28))|~p3(X2,X3))).
% 0.22/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.43 # Begin printing tableau
% 0.22/0.43 # Found 12 steps
% 0.22/0.43 cnf(i_0_88, negated_conjecture, (p24(f4(f6(c32,c30),f17(f19(f21(f23(c33,f4(c27,c28)),f4(c30,c28)),c30),c30)),f9(f11(f13(f15(c34,f4(c27,c28)),f4(c30,c28)),c30),c30))|p24(f4(c27,c28),c29)|~p26(c31,c30)|~p2(c30,c30)|~p3(f4(c30,c28),f4(c30,c28))|~p3(f4(c27,c28),f4(c30,c28))), inference(start_rule)).
% 0.22/0.43 cnf(i_0_90, plain, (p24(f4(c27,c28),c29)), inference(closure_rule, [i_0_60])).
% 0.22/0.43 cnf(i_0_91, plain, (~p26(c31,c30)), inference(closure_rule, [i_0_59])).
% 0.22/0.43 cnf(i_0_92, plain, (~p2(c30,c30)), inference(closure_rule, [i_0_53])).
% 0.22/0.43 cnf(i_0_93, plain, (~p3(f4(c30,c28),f4(c30,c28))), inference(closure_rule, [i_0_49])).
% 0.22/0.43 cnf(i_0_89, plain, (p24(f4(f6(c32,c30),f17(f19(f21(f23(c33,f4(c27,c28)),f4(c30,c28)),c30),c30)),f9(f11(f13(f15(c34,f4(c27,c28)),f4(c30,c28)),c30),c30))), inference(extension_rule, [i_0_75])).
% 0.22/0.43 cnf(i_0_238, plain, (p24(f4(c27,c28),c29)), inference(closure_rule, [i_0_60])).
% 0.22/0.43 cnf(i_0_240, plain, (~p3(f4(f6(c32,c30),f17(f19(f21(f23(c33,f4(c27,c28)),f4(c30,c28)),c30),c30)),f4(c27,c28))), inference(extension_rule, [i_0_85])).
% 0.22/0.43 cnf(i_0_94, plain, (~p3(f4(c27,c28),f4(c30,c28))), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.22/0.43 cnf(i_0_241, plain, (~p8(f9(f11(f13(f15(c34,f4(c27,c28)),f4(c30,c28)),c30),c30),c29)), inference(etableau_closure_rule, [i_0_241, ...])).
% 0.22/0.43 cnf(i_0_273, plain, (~p2(f6(c32,c30),c27)), inference(etableau_closure_rule, [i_0_273, ...])).
% 0.22/0.43 cnf(i_0_274, plain, (~p3(f17(f19(f21(f23(c33,f4(c27,c28)),f4(c30,c28)),c30),c30),c28)), inference(etableau_closure_rule, [i_0_274, ...])).
% 0.22/0.43 # End printing tableau
% 0.22/0.43 # SZS output end
% 0.22/0.43 # Branches closed with saturation will be marked with an "s"
% 0.22/0.43 # Child (1903) has found a proof.
% 0.22/0.43
% 0.22/0.43 # Proof search is over...
% 0.22/0.43 # Freeing feature tree
%------------------------------------------------------------------------------