TSTP Solution File: TOP053-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : TOP053-1 : TPTP v8.1.0. Released v8.1.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 : n032.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 21:25:45 EDT 2022
% Result : Unsatisfiable 0.14s 0.34s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : TOP053-1 : TPTP v8.1.0. Released v8.1.0.
% 0.00/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun May 29 14:20:26 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.31 # No SInE strategy applied
% 0.14/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.31 #
% 0.14/0.31 # Presaturation interreduction done
% 0.14/0.31 # Number of axioms: 19 Number of unprocessed: 19
% 0.14/0.31 # Tableaux proof search.
% 0.14/0.31 # APR header successfully linked.
% 0.14/0.31 # Hello from C++
% 0.14/0.32 # The folding up rule is enabled...
% 0.14/0.32 # Local unification is enabled...
% 0.14/0.32 # Any saturation attempts will use folding labels...
% 0.14/0.32 # 19 beginning clauses after preprocessing and clausification
% 0.14/0.32 # Creating start rules for all 1 conjectures.
% 0.14/0.32 # There are 1 start rule candidates:
% 0.14/0.32 # Found 19 unit axioms.
% 0.14/0.32 # 1 start rule tableaux created.
% 0.14/0.32 # 0 extension rule candidate clauses
% 0.14/0.32 # 19 unit axiom clauses
% 0.14/0.32
% 0.14/0.32 # Requested 8, 32 cores available to the main process.
% 0.14/0.32 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.32 # Creating equality axioms
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Returning from population with 37 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.32 # We now have 37 tableaux to operate on
% 0.14/0.34 # There were 1 total branch saturation attempts.
% 0.14/0.34 # There were 0 of these attempts blocked.
% 0.14/0.34 # There were 0 deferred branch saturation attempts.
% 0.14/0.34 # There were 0 free duplicated saturations.
% 0.14/0.34 # There were 1 total successful branch saturations.
% 0.14/0.34 # There were 0 successful branch saturations in interreduction.
% 0.14/0.34 # There were 0 successful branch saturations on the branch.
% 0.14/0.34 # There were 1 successful branch saturations after the branch.
% 0.14/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.34 # Begin clausification derivation
% 0.14/0.34
% 0.14/0.34 # End clausification derivation
% 0.14/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.34 cnf(i_0_23, plain, (product(a1,a2)=a3)).
% 0.14/0.34 cnf(i_0_33, plain, (product(a2,a12)=a14)).
% 0.14/0.34 cnf(i_0_24, plain, (product(a3,a4)=a5)).
% 0.14/0.34 cnf(i_0_36, plain, (product(a4,a7)=a11)).
% 0.14/0.34 cnf(i_0_25, plain, (product(a5,a6)=a7)).
% 0.14/0.34 cnf(i_0_32, plain, (product(a6,a7)=a2)).
% 0.14/0.34 cnf(i_0_26, plain, (product(a7,a3)=a8)).
% 0.14/0.34 cnf(i_0_20, plain, (product(X1,X1)=X1)).
% 0.14/0.34 cnf(i_0_27, plain, (product(a8,a2)=a9)).
% 0.14/0.34 cnf(i_0_28, plain, (product(a9,a1)=a10)).
% 0.14/0.34 cnf(i_0_29, plain, (product(a10,a11)=a12)).
% 0.14/0.34 cnf(i_0_37, plain, (product(a11,a10)=a1)).
% 0.14/0.34 cnf(i_0_30, plain, (product(a12,a3)=a13)).
% 0.14/0.34 cnf(i_0_31, plain, (product(a13,a8)=a6)).
% 0.14/0.34 cnf(i_0_34, plain, (product(a14,a3)=a15)).
% 0.14/0.34 cnf(i_0_35, plain, (product(a15,a8)=a4)).
% 0.14/0.34 cnf(i_0_21, plain, (product(product(X1,X2),X2)=X1)).
% 0.14/0.34 cnf(i_0_22, plain, (product(product(X1,X2),product(X3,X2))=product(product(X1,X3),X2))).
% 0.14/0.34 cnf(i_0_38, negated_conjecture, (tuple(a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14)!=tuple(a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15))).
% 0.14/0.34 cnf(i_0_40, plain, (X4=X4)).
% 0.14/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.34 # Begin printing tableau
% 0.14/0.34 # Found 18 steps
% 0.14/0.34 cnf(i_0_23, plain, (product(a1,a2)=a3), inference(start_rule)).
% 0.14/0.34 cnf(i_0_46, plain, (product(a1,a2)=a3), inference(extension_rule, [i_0_45])).
% 0.14/0.34 cnf(i_0_77, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_78, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_79, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_80, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_81, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_82, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_83, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_84, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_85, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_86, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_87, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_88, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_89, plain, (product(a1,a2)!=a3), inference(closure_rule, [i_0_23])).
% 0.14/0.34 cnf(i_0_76, plain, (tuple(product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2))=tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3)), inference(extension_rule, [i_0_43])).
% 0.14/0.34 cnf(i_0_97, plain, (tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3)!=product(tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3),tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3))), inference(closure_rule, [i_0_20])).
% 0.14/0.34 cnf(i_0_95, plain, (tuple(product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2),product(a1,a2))=product(tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3),tuple(a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3,a3))), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.14/0.34 # End printing tableau
% 0.14/0.34 # SZS output end
% 0.14/0.34 # Branches closed with saturation will be marked with an "s"
% 0.14/0.34 # Child (31583) has found a proof.
% 0.14/0.34
% 0.14/0.34 # Proof search is over...
% 0.14/0.34 # Freeing feature tree
%------------------------------------------------------------------------------