TSTP Solution File: SYN577-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN577-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:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN577-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/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 : 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 : Tue Jul 12 02:40:13 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: 22 Number of unprocessed: 22
% 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 # 22 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 22 conjectures.
% 0.12/0.37 # There are 22 start rule candidates:
% 0.12/0.37 # Found 12 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 22 start rule tableaux created.
% 0.12/0.37 # 10 extension rule candidate clauses
% 0.12/0.37 # 12 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.41 # There were 2 total branch saturation attempts.
% 0.20/0.41 # There were 0 of these attempts blocked.
% 0.20/0.41 # There were 0 deferred branch saturation attempts.
% 0.20/0.41 # There were 0 free duplicated saturations.
% 0.20/0.41 # There were 2 total successful branch saturations.
% 0.20/0.41 # There were 0 successful branch saturations in interreduction.
% 0.20/0.41 # There were 0 successful branch saturations on the branch.
% 0.20/0.41 # There were 2 successful branch saturations after the branch.
% 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # Begin clausification derivation
% 0.20/0.41
% 0.20/0.41 # End clausification derivation
% 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.41 cnf(i_0_24, negated_conjecture, (p8(c14,c13))).
% 0.20/0.41 cnf(i_0_28, negated_conjecture, (p8(c14,c11))).
% 0.20/0.41 cnf(i_0_26, negated_conjecture, (p7(c13,c12))).
% 0.20/0.41 cnf(i_0_25, negated_conjecture, (p7(c11,c12))).
% 0.20/0.41 cnf(i_0_27, negated_conjecture, (p7(c9,c10))).
% 0.20/0.41 cnf(i_0_23, negated_conjecture, (p2(X1,X1))).
% 0.20/0.41 cnf(i_0_32, negated_conjecture, (p2(f3(c12,c13),c16))).
% 0.20/0.41 cnf(i_0_29, negated_conjecture, (p2(f3(c12,c11),c15))).
% 0.20/0.41 cnf(i_0_31, negated_conjecture, (p2(f4(c15,c14),c17))).
% 0.20/0.41 cnf(i_0_30, negated_conjecture, (p2(f4(c16,c14),c18))).
% 0.20/0.41 cnf(i_0_33, negated_conjecture, (p2(f5(f6(c9),c19),c17))).
% 0.20/0.41 cnf(i_0_34, negated_conjecture, (p2(f5(f6(c9),c20),c18))).
% 0.20/0.41 cnf(i_0_36, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.41 cnf(i_0_35, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.20/0.41 cnf(i_0_42, negated_conjecture, (~p7(X1,c10)|~p2(f4(X2,c14),f5(f6(X1),c20))|~p2(f4(X3,c14),f5(f6(X1),c19))|~p2(c15,X3)|~p2(c16,X2))).
% 0.20/0.41 cnf(i_0_39, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.20/0.41 cnf(i_0_37, negated_conjecture, (p8(X1,X2)|~p8(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 0.20/0.41 cnf(i_0_41, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.20/0.41 cnf(i_0_38, negated_conjecture, (p7(X1,X2)|~p7(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 0.20/0.41 cnf(i_0_40, negated_conjecture, (p2(f5(X1,X2),f5(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.20/0.41 cnf(i_0_44, negated_conjecture, (p2(X1,X2)|~p7(X3,c12)|~p7(X4,c12)|~p7(X5,c10)|~p8(c14,X3)|~p8(c14,X4)|~p2(f4(X6,c14),f5(f6(X5),X1))|~p2(f4(X7,c14),f5(f6(X5),X2))|~p2(f3(c12,X3),X7)|~p2(f3(c12,X4),X6))).
% 0.20/0.41 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p7(X3,c10)|~p7(X2,c12)|~p7(X1,c12)|~p8(c14,X2)|~p8(c14,X1)|~p2(f4(X4,c14),f5(f6(X3),X5))|~p2(f4(X6,c14),f5(f6(X3),X7))|~p2(f3(c12,X2),X6)|~p2(f3(c12,X1),X4))).
% 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.41 # Begin printing tableau
% 0.20/0.41 # Found 9 steps
% 0.20/0.41 cnf(i_0_40, negated_conjecture, (p2(f5(f5(f6(c9),c20),f5(f6(c9),c20)),f5(c18,c18))|~p2(f5(f6(c9),c20),c18)|~p2(f5(f6(c9),c20),c18)), inference(start_rule)).
% 0.20/0.41 cnf(i_0_66, plain, (~p2(f5(f6(c9),c20),c18)), inference(closure_rule, [i_0_34])).
% 0.20/0.41 cnf(i_0_67, plain, (~p2(f5(f6(c9),c20),c18)), inference(closure_rule, [i_0_34])).
% 0.20/0.41 cnf(i_0_65, plain, (p2(f5(f5(f6(c9),c20),f5(f6(c9),c20)),f5(c18,c18))), inference(extension_rule, [i_0_40])).
% 0.20/0.41 cnf(i_0_126, plain, (~p2(f5(f6(c9),c20),c18)), inference(closure_rule, [i_0_34])).
% 0.20/0.41 cnf(i_0_124, plain, (p2(f5(f5(f6(c9),c20),f5(f5(f6(c9),c20),f5(f6(c9),c20))),f5(c18,f5(c18,c18)))), inference(extension_rule, [i_0_38])).
% 0.20/0.41 cnf(i_0_150, plain, (~p2(f5(f6(c9),c20),c18)), inference(closure_rule, [i_0_34])).
% 0.20/0.41 cnf(i_0_147, plain, (p7(f5(c18,f5(c18,c18)),c18)), inference(etableau_closure_rule, [i_0_147, ...])).
% 0.20/0.41 cnf(i_0_148, plain, (~p7(f5(f5(f6(c9),c20),f5(f5(f6(c9),c20),f5(f6(c9),c20))),f5(f6(c9),c20))), inference(etableau_closure_rule, [i_0_148, ...])).
% 0.20/0.41 # End printing tableau
% 0.20/0.41 # SZS output end
% 0.20/0.41 # Branches closed with saturation will be marked with an "s"
% 0.20/0.41 # Child (2830) has found a proof.
% 0.20/0.41
% 0.20/0.41 # Proof search is over...
% 0.20/0.41 # Freeing feature tree
%------------------------------------------------------------------------------