%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : TOP050-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 : n020.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.88s 0.57s % Output : CNFRefutation 0.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : TOP050-1 : TPTP v8.1.0. Released v8.1.0. % 0.14/0.15 % 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 : n020.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.37 % WCLimit : 600 % 0.14/0.37 % DateTime : Sun May 29 03:45:24 EDT 2022 % 0.14/0.37 % 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: 35 Number of unprocessed: 35 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.22/0.46 # The folding up rule is enabled... % 0.22/0.46 # Local unification is enabled... % 0.22/0.46 # Any saturation attempts will use folding labels... % 0.22/0.46 # 35 beginning clauses after preprocessing and clausification % 0.22/0.46 # Creating start rules for all 1 conjectures. % 0.22/0.46 # There are 1 start rule candidates: % 0.22/0.46 # Found 35 unit axioms. % 0.22/0.46 # 1 start rule tableaux created. % 0.22/0.46 # 0 extension rule candidate clauses % 0.22/0.46 # 35 unit axiom clauses % 0.22/0.46 % 0.22/0.46 # Requested 8, 32 cores available to the main process. % 0.22/0.46 # There are not enough tableaux to fork, creating more from the initial 1 % 0.22/0.46 # Creating equality axioms % 0.22/0.46 # Ran out of tableaux, making start rules for all clauses % 0.22/0.46 # Returning from population with 70 new_tableaux and 0 remaining starting tableaux. % 0.22/0.46 # We now have 70 tableaux to operate on % 0.88/0.57 # There were 1 total branch saturation attempts. % 0.88/0.57 # There were 0 of these attempts blocked. % 0.88/0.57 # There were 0 deferred branch saturation attempts. % 0.88/0.57 # There were 0 free duplicated saturations. % 0.88/0.57 # There were 1 total successful branch saturations. % 0.88/0.57 # There were 0 successful branch saturations in interreduction. % 0.88/0.57 # There were 0 successful branch saturations on the branch. % 0.88/0.57 # There were 1 successful branch saturations after the branch. % 0.88/0.57 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.88/0.57 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.88/0.57 # Begin clausification derivation % 0.88/0.57 % 0.88/0.57 # End clausification derivation % 0.88/0.57 # Begin listing active clauses obtained from FOF to CNF conversion % 0.88/0.57 cnf(i_0_39, plain, (product(a1,a31)=a2)). % 0.88/0.57 cnf(i_0_68, plain, (product(a31,a3)=a32)). % 0.88/0.57 cnf(i_0_40, plain, (product(a2,a25)=a3)). % 0.88/0.57 cnf(i_0_62, plain, (product(a25,a23)=a26)). % 0.88/0.57 cnf(i_0_41, plain, (product(a3,a29)=a4)). % 0.88/0.57 cnf(i_0_66, plain, (product(a29,a1)=a30)). % 0.88/0.57 cnf(i_0_42, plain, (product(a4,a11)=a5)). % 0.88/0.57 cnf(i_0_36, plain, (product(X1,X1)=X1)). % 0.88/0.57 cnf(i_0_48, plain, (product(a11,a5)=a12)). % 0.88/0.57 cnf(i_0_43, plain, (product(a5,a15)=a6)). % 0.88/0.57 cnf(i_0_52, plain, (product(a15,a5)=a16)). % 0.88/0.57 cnf(i_0_44, plain, (product(a7,a19)=a8)). % 0.88/0.57 cnf(i_0_56, plain, (product(a19,a11)=a20)). % 0.88/0.57 cnf(i_0_45, plain, (product(a8,a5)=a9)). % 0.88/0.57 cnf(i_0_46, plain, (product(a9,a17)=a10)). % 0.88/0.57 cnf(i_0_54, plain, (product(a17,a9)=a18)). % 0.88/0.57 cnf(i_0_47, plain, (product(a10,a7)=a11)). % 0.88/0.57 cnf(i_0_49, plain, (product(a12,a19)=a13)). % 0.88/0.57 cnf(i_0_50, plain, (product(a13,a7)=a14)). % 0.88/0.57 cnf(i_0_51, plain, (product(a14,a17)=a15)). % 0.88/0.57 cnf(i_0_53, plain, (product(a16,a19)=a17)). % 0.88/0.57 cnf(i_0_55, plain, (product(a18,a15)=a19)). % 0.88/0.57 cnf(i_0_57, plain, (product(a20,a29)=a21)). % 0.88/0.57 cnf(i_0_58, plain, (product(a21,a25)=a22)). % 0.88/0.57 cnf(i_0_59, plain, (product(a22,a31)=a23)). % 0.88/0.57 cnf(i_0_60, plain, (product(a23,a21)=a24)). % 0.88/0.57 cnf(i_0_61, plain, (product(a24,a3)=a25)). % 0.88/0.57 cnf(i_0_63, plain, (product(a26,a1)=a27)). % 0.88/0.57 cnf(i_0_64, plain, (product(a27,a21)=a28)). % 0.88/0.57 cnf(i_0_65, plain, (product(a28,a3)=a29)). % 0.88/0.57 cnf(i_0_67, plain, (product(a30,a23)=a31)). % 0.88/0.57 cnf(i_0_69, plain, (product(a32,a21)=a1)). % 0.88/0.57 cnf(i_0_37, plain, (product(product(X1,X2),X2)=X1)). % 0.88/0.57 cnf(i_0_38, plain, (product(product(X1,X2),product(X3,X2))=product(product(X1,X3),X2))). % 0.88/0.57 cnf(i_0_70, negated_conjecture, (tuple(a2,a31,a32,a3,a25,a26,a4,a29,a30,a5,a11,a12,a6,a15,a16,a7,a8,a19,a20,a9,a10,a17,a18,a13,a14,a21,a22,a23,a24,a27,a28)!=tuple(a1,a30,a31,a2,a24,a25,a3,a28,a29,a4,a10,a11,a5,a14,a15,a6,a7,a18,a19,a8,a9,a16,a17,a12,a13,a20,a21,a22,a23,a26,a27))). % 0.88/0.57 cnf(i_0_72, plain, (X4=X4)). % 0.88/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.88/0.57 # Begin printing tableau % 0.88/0.57 # Found 35 steps % 0.88/0.57 cnf(i_0_39, plain, (product(a1,a31)=a2), inference(start_rule)). % 0.88/0.57 cnf(i_0_78, plain, (product(a1,a31)=a2), inference(extension_rule, [i_0_77])). % 0.88/0.57 cnf(i_0_125, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_126, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_127, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_128, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_129, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_130, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_131, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_132, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_133, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_134, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_135, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_136, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_137, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_138, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_139, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_140, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_141, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_142, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_143, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_144, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_145, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_146, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_147, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_149, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_150, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_151, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_152, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_153, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_154, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_155, plain, (product(a1,a31)!=a2), inference(closure_rule, [i_0_39])). % 0.88/0.57 cnf(i_0_124, plain, (tuple(product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31))=tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2)), inference(extension_rule, [i_0_75])). % 0.88/0.57 cnf(i_0_162, plain, (tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2)!=product(tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2),tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2))), inference(closure_rule, [i_0_36])). % 0.88/0.57 cnf(i_0_160, plain, (tuple(product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31),product(a1,a31))=product(tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2),tuple(a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2,a2))), inference(etableau_closure_rule, [i_0_160, ...])). % 0.88/0.57 # End printing tableau % 0.88/0.57 # SZS output end % 0.88/0.57 # Branches closed with saturation will be marked with an "s" % 1.05/0.58 # Child (8311) has found a proof. % 1.05/0.58 % 1.05/0.58 # Proof search is over... % 1.05/0.58 # Freeing feature tree %------------------------------------------------------------------------------