TSTP Solution File: SYN578-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN578-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 : n007.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.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN578-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.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 00:40:18 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: 23 Number of unprocessed: 23
% 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 # 23 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 23 conjectures.
% 0.12/0.37 # There are 23 start rule candidates:
% 0.12/0.37 # Found 9 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 23 start rule tableaux created.
% 0.12/0.37 # 14 extension rule candidate clauses
% 0.12/0.37 # 9 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.40 # There were 1 total branch saturation attempts.
% 0.12/0.40 # There were 0 of these attempts blocked.
% 0.12/0.40 # There were 0 deferred branch saturation attempts.
% 0.12/0.40 # There were 0 free duplicated saturations.
% 0.12/0.40 # There were 1 total successful branch saturations.
% 0.12/0.40 # There were 0 successful branch saturations in interreduction.
% 0.12/0.40 # There were 0 successful branch saturations on the branch.
% 0.12/0.40 # There were 1 successful branch saturations after the branch.
% 0.12/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # Begin clausification derivation
% 0.12/0.40
% 0.12/0.40 # End clausification derivation
% 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.40 cnf(i_0_28, negated_conjecture, (p9(c12,c13))).
% 0.12/0.40 cnf(i_0_29, negated_conjecture, (p11(c14,c15))).
% 0.12/0.40 cnf(i_0_30, negated_conjecture, (p2(c16,f5(c14)))).
% 0.12/0.40 cnf(i_0_24, negated_conjecture, (p10(X1,X1))).
% 0.12/0.40 cnf(i_0_25, negated_conjecture, (p7(X1,X1))).
% 0.12/0.40 cnf(i_0_26, negated_conjecture, (p3(X1,X1))).
% 0.12/0.40 cnf(i_0_27, negated_conjecture, (p2(X1,X1))).
% 0.12/0.40 cnf(i_0_31, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))).
% 0.12/0.40 cnf(i_0_32, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))).
% 0.12/0.40 cnf(i_0_33, negated_conjecture, (p9(X1,c13)|~p9(X1,f4(c16)))).
% 0.12/0.40 cnf(i_0_34, negated_conjecture, (p9(X1,f4(c16))|~p9(X1,c13))).
% 0.12/0.40 cnf(i_0_38, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.12/0.40 cnf(i_0_39, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.12/0.40 cnf(i_0_37, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.12/0.40 cnf(i_0_36, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.12/0.40 cnf(i_0_35, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.12/0.40 cnf(i_0_40, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.12/0.40 cnf(i_0_41, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.12/0.40 cnf(i_0_43, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))).
% 0.12/0.40 cnf(i_0_42, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.12/0.40 cnf(i_0_46, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X1),f4(X1))|~p9(f8(X2,X1),X2)|~p9(c12,X2))).
% 0.12/0.40 cnf(i_0_44, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.12/0.40 cnf(i_0_45, negated_conjecture, (p9(f8(X1,X2),f4(X2))|p9(f8(X1,X2),X1)|~p11(X2,c15)|~p9(c12,X1))).
% 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.40 # Begin printing tableau
% 0.12/0.40 # Found 8 steps
% 0.12/0.40 cnf(i_0_40, negated_conjecture, (p3(f6(f5(X1)),f6(f5(X1)))|~p3(f6(f5(f5(X1))),f6(f5(X1)))|~p3(f6(f5(f5(X1))),f6(f5(X1)))), inference(start_rule)).
% 0.12/0.40 cnf(i_0_70, plain, (~p3(f6(f5(f5(X1))),f6(f5(X1)))), inference(closure_rule, [i_0_32])).
% 0.12/0.40 cnf(i_0_71, plain, (~p3(f6(f5(f5(X1))),f6(f5(X1)))), inference(closure_rule, [i_0_32])).
% 0.12/0.40 cnf(i_0_69, plain, (p3(f6(f5(X1)),f6(f5(X1)))), inference(extension_rule, [i_0_40])).
% 0.12/0.40 cnf(i_0_1542, plain, (~p3(f6(f5(X1)),f6(X1))), inference(closure_rule, [i_0_32])).
% 0.12/0.40 cnf(i_0_1540, plain, (p3(f6(X1),f6(f5(X1)))), inference(extension_rule, [i_0_44])).
% 0.12/0.40 cnf(i_0_2075, plain, (~p2(X6,X6)), inference(closure_rule, [i_0_27])).
% 0.12/0.40 cnf(i_0_2074, plain, (p7(f8(f6(X1),X6),f8(f6(f5(X1)),X6))), inference(etableau_closure_rule, [i_0_2074, ...])).
% 0.12/0.40 # End printing tableau
% 0.12/0.40 # SZS output end
% 0.12/0.40 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # Child (6092) has found a proof.
% 0.12/0.40
% 0.12/0.40 # Proof search is over...
% 0.12/0.40 # Freeing feature tree
%------------------------------------------------------------------------------