TSTP Solution File: SYN583-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN583-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:37 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN583-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 11:41:34 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 25 Number of unprocessed: 25
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 25 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 25 conjectures.
% 0.14/0.39 # There are 25 start rule candidates:
% 0.14/0.39 # Found 9 unit axioms.
% 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39 # 25 start rule tableaux created.
% 0.14/0.39 # 16 extension rule candidate clauses
% 0.14/0.39 # 9 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_29, negated_conjecture, (p2(c13,c18))).
% 0.14/0.39 cnf(i_0_30, negated_conjecture, (p2(c18,c14))).
% 0.14/0.39 cnf(i_0_31, negated_conjecture, (p2(f3(c18),f8(f9(c17))))).
% 0.14/0.39 cnf(i_0_32, negated_conjecture, (p11(f4(f6(c15,c13)),c16))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (p7(X1,X1))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (p2(X1,X1))).
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (p5(X1,X1))).
% 0.14/0.39 cnf(i_0_33, negated_conjecture, (p11(f4(f6(c15,c14)),c16))).
% 0.14/0.39 cnf(i_0_34, negated_conjecture, (~p11(f4(f6(c15,c18)),c16))).
% 0.14/0.39 cnf(i_0_35, negated_conjecture, (p11(X1,X2)|~p12(X1,X2))).
% 0.14/0.39 cnf(i_0_36, negated_conjecture, (p11(X1,X2)|~p2(X1,X2))).
% 0.14/0.39 cnf(i_0_41, negated_conjecture, (p12(X1,X2)|p2(X1,X2)|~p11(X1,X2))).
% 0.14/0.39 cnf(i_0_50, negated_conjecture, (p11(f4(f6(c15,X1)),c16)|~p12(X1,c14)|~p12(c13,X1)|~p2(f3(X1),f8(f9(c17))))).
% 0.14/0.39 cnf(i_0_37, negated_conjecture, (p7(f9(X1),f9(X2))|~p7(X1,X2))).
% 0.14/0.39 cnf(i_0_38, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.14/0.39 cnf(i_0_40, negated_conjecture, (p2(f8(X1),f8(X2))|~p7(X1,X2))).
% 0.14/0.39 cnf(i_0_39, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.14/0.39 cnf(i_0_45, negated_conjecture, (p10(c15,f3(X1),X1)|~p11(X1,c14)|~p11(c13,X1))).
% 0.14/0.39 cnf(i_0_42, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.14/0.39 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.14/0.39 cnf(i_0_44, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.14/0.39 cnf(i_0_46, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.14/0.39 cnf(i_0_48, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p5(X1,X3)|~p2(X2,X4))).
% 0.14/0.39 cnf(i_0_47, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.14/0.39 cnf(i_0_49, negated_conjecture, (p10(X1,X2,X3)|~p10(X4,X5,X6)|~p5(X4,X1)|~p2(X5,X2)|~p2(X6,X3))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 8 steps
% 0.14/0.39 cnf(i_0_46, negated_conjecture, (p11(f4(f6(c15,c18)),c16)|~p11(f4(f6(c15,c14)),c16)|~p2(c16,c16)|~p2(f4(f6(c15,c14)),f4(f6(c15,c18)))), inference(start_rule)).
% 0.14/0.39 cnf(i_0_63, plain, (p11(f4(f6(c15,c18)),c16)), inference(closure_rule, [i_0_34])).
% 0.14/0.39 cnf(i_0_64, plain, (~p11(f4(f6(c15,c14)),c16)), inference(closure_rule, [i_0_33])).
% 0.14/0.39 cnf(i_0_65, plain, (~p2(c16,c16)), inference(closure_rule, [i_0_27])).
% 0.14/0.39 cnf(i_0_66, plain, (~p2(f4(f6(c15,c14)),f4(f6(c15,c18)))), inference(extension_rule, [i_0_43])).
% 0.14/0.39 cnf(i_0_127, plain, (~p2(f4(f6(c15,c18)),f4(f6(c15,c18)))), inference(closure_rule, [i_0_27])).
% 0.14/0.39 cnf(i_0_128, plain, (~p2(f4(f6(c15,c18)),f4(f6(c15,c14)))), inference(extension_rule, [i_0_39])).
% 0.14/0.39 cnf(i_0_155, plain, (~p2(f6(c15,c18),f6(c15,c14))), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Child (17660) has found a proof.
% 0.14/0.40
% 0.14/0.40 # Proof search is over...
% 0.14/0.40 # Freeing feature tree
%------------------------------------------------------------------------------