TSTP Solution File: SYN623-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN623-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 : n024.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:54 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN623-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.12/0.33 % Computer : n024.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 15:23:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 35 Number of unprocessed: 35
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 35 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 35 conjectures.
% 0.12/0.37 # There are 35 start rule candidates:
% 0.12/0.37 # Found 15 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 35 start rule tableaux created.
% 0.12/0.37 # 20 extension rule candidate clauses
% 0.12/0.37 # 15 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_46, negated_conjecture, (p3(c22,c23))).
% 0.20/0.39 cnf(i_0_47, negated_conjecture, (p2(c24,c25))).
% 0.20/0.39 cnf(i_0_45, negated_conjecture, (p18(c26,c25))).
% 0.20/0.39 cnf(i_0_49, negated_conjecture, (p3(c23,f4(c24,c20)))).
% 0.20/0.39 cnf(i_0_36, negated_conjecture, (p10(X1,X1))).
% 0.20/0.39 cnf(i_0_37, negated_conjecture, (p8(X1,X1))).
% 0.20/0.39 cnf(i_0_38, negated_conjecture, (p7(X1,X1))).
% 0.20/0.39 cnf(i_0_39, negated_conjecture, (p5(X1,X1))).
% 0.20/0.39 cnf(i_0_40, negated_conjecture, (p3(X1,X1))).
% 0.20/0.39 cnf(i_0_41, negated_conjecture, (p2(X1,X1))).
% 0.20/0.39 cnf(i_0_42, negated_conjecture, (p17(X1,X1))).
% 0.20/0.39 cnf(i_0_50, negated_conjecture, (p16(f4(c19,c20),c21))).
% 0.20/0.39 cnf(i_0_43, negated_conjecture, (p14(X1,X1))).
% 0.20/0.39 cnf(i_0_44, negated_conjecture, (p12(X1,X1))).
% 0.20/0.39 cnf(i_0_48, negated_conjecture, (~p16(c22,c21))).
% 0.20/0.39 cnf(i_0_60, negated_conjecture, (p16(f4(c25,X1),X2)|~p16(f4(f6(c27,c25),X1),X2))).
% 0.20/0.39 cnf(i_0_51, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.39 cnf(i_0_52, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.20/0.39 cnf(i_0_53, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.39 cnf(i_0_54, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.39 cnf(i_0_55, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.39 cnf(i_0_56, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.39 cnf(i_0_57, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.39 cnf(i_0_58, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.39 cnf(i_0_59, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.39 cnf(i_0_63, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p7(X1,X3))).
% 0.20/0.39 cnf(i_0_68, negated_conjecture, (p7(f11(X1,X2),f11(X3,X4))|~p2(X2,X4)|~p10(X1,X3))).
% 0.20/0.39 cnf(i_0_62, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p17(X3,X1)|~p2(X4,X2))).
% 0.20/0.39 cnf(i_0_67, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.39 cnf(i_0_61, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p3(X3,X1)|~p8(X4,X2))).
% 0.20/0.39 cnf(i_0_66, negated_conjecture, (p3(f13(X1,X2),f13(X3,X4))|~p12(X1,X3)|~p2(X2,X4))).
% 0.20/0.39 cnf(i_0_65, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.39 cnf(i_0_64, negated_conjecture, (p12(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p2(X2,X4))).
% 0.20/0.39 cnf(i_0_69, negated_conjecture, (p16(f4(X1,X2),X3)|~p16(f4(X4,f13(f15(c28,X1),X4)),f9(f11(c29,X1),X4))|~p16(f4(c19,X2),X3)|~p18(c26,X4)|~p2(X1,X4))).
% 0.20/0.39 cnf(i_0_70, negated_conjecture, (p16(f4(f6(c27,X1),f13(f15(c28,X2),X1)),f9(f11(c29,X2),X1))|p16(f4(X2,X3),X4)|~p16(f4(c19,X3),X4)|~p18(c26,X1)|~p2(X2,X1))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 8 steps
% 0.20/0.39 cnf(i_0_64, negated_conjecture, (p12(f15(X10,X9),f15(X10,X9))|~p14(X10,X10)|~p2(X9,X9)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_82, plain, (~p14(X10,X10)), inference(closure_rule, [i_0_43])).
% 0.20/0.39 cnf(i_0_83, plain, (~p2(X9,X9)), inference(closure_rule, [i_0_41])).
% 0.20/0.39 cnf(i_0_81, plain, (p12(f15(X10,X9),f15(X10,X9))), inference(extension_rule, [i_0_66])).
% 0.20/0.39 cnf(i_0_169, plain, (~p2(X6,X6)), inference(closure_rule, [i_0_41])).
% 0.20/0.39 cnf(i_0_167, plain, (p3(f13(f15(X10,X9),X6),f13(f15(X10,X9),X6))), inference(extension_rule, [i_0_67])).
% 0.20/0.39 cnf(i_0_662, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_41])).
% 0.20/0.39 cnf(i_0_661, plain, (p3(f4(X5,f13(f15(X10,X9),X6)),f4(X5,f13(f15(X10,X9),X6)))), inference(etableau_closure_rule, [i_0_661, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Child (26288) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------