%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM431+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 09:40:57 EDT 2022 % Result : Theorem 1.61s 0.65s % Output : CNFRefutation 1.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUM431+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/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 : n007.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 : Wed Jul 6 21:11:44 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_S2m % 0.14/0.39 # and selection function SelectCQArNTNpEqFirst. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 43 Number of unprocessed: 43 % 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 # 43 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 14 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 29 extension rule candidate clauses % 0.14/0.39 # 14 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 are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 56 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 56 tableaux to operate on % 1.61/0.65 # There were 6 total branch saturation attempts. % 1.61/0.65 # There were 0 of these attempts blocked. % 1.61/0.65 # There were 0 deferred branch saturation attempts. % 1.61/0.65 # There were 2 free duplicated saturations. % 1.61/0.65 # There were 6 total successful branch saturations. % 1.61/0.65 # There were 0 successful branch saturations in interreduction. % 1.61/0.65 # There were 0 successful branch saturations on the branch. % 1.61/0.65 # There were 4 successful branch saturations after the branch. % 1.61/0.65 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.61/0.65 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.61/0.65 # Begin clausification derivation % 1.61/0.65 % 1.61/0.65 # End clausification derivation % 1.61/0.65 # Begin listing active clauses obtained from FOF to CNF conversion % 1.61/0.65 cnf(i_0_40, hypothesis, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,xn))). % 1.61/0.65 cnf(i_0_42, hypothesis, (sdtpldt0(xb,smndt0(xc))=sdtasdt0(xq,xm))). % 1.61/0.65 cnf(i_0_37, hypothesis, (aInteger0(xa))). % 1.61/0.65 cnf(i_0_2, plain, (aInteger0(sz00))). % 1.61/0.65 cnf(i_0_35, hypothesis, (aInteger0(xq))). % 1.61/0.65 cnf(i_0_3, plain, (aInteger0(sz10))). % 1.61/0.65 cnf(i_0_36, hypothesis, (aInteger0(xb))). % 1.61/0.65 cnf(i_0_33, hypothesis, (aInteger0(xc))). % 1.61/0.65 cnf(i_0_41, hypothesis, (aInteger0(xn))). % 1.61/0.65 cnf(i_0_43, hypothesis, (aInteger0(xm))). % 1.61/0.65 cnf(i_0_39, hypothesis, (sdteqdtlpzmzozddtrp0(xa,xb,xq))). % 1.61/0.65 cnf(i_0_38, hypothesis, (sdteqdtlpzmzozddtrp0(xb,xc,xq))). % 1.61/0.65 cnf(i_0_34, hypothesis, (xq!=sz00)). % 1.61/0.65 cnf(i_0_44, negated_conjecture, (sdtpldt0(xa,smndt0(xc))!=sdtasdt0(xq,sdtpldt0(xn,xm)))). % 1.61/0.65 cnf(i_0_4, plain, (aInteger0(smndt0(X1))|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_19, plain, (sdtasdt0(sz00,X1)=sz00|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_20, plain, (sdtasdt0(X1,sz00)=sz00|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_27, plain, (~aDivisorOf0(sz00,X1)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_28, plain, (aInteger0(X1)|~aDivisorOf0(X1,X2)|~aInteger0(X2))). % 1.61/0.65 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_21, plain, (sdtasdt0(X1,smndt0(sz10))=smndt0(X1)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_22, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_5, plain, (aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_6, plain, (aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_26, plain, (aInteger0(esk1_2(X1,X2))|~aDivisorOf0(X2,X1)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_31, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X2,X1)|~aInteger0(X1)|~aInteger0(X2))). % 1.61/0.65 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_8, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_14, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_25, plain, (sdtasdt0(X1,esk1_2(X2,X1))=X2|~aDivisorOf0(X1,X2)|~aInteger0(X2))). % 1.61/0.65 cnf(i_0_7, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_13, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_24, plain, (X1=sz00|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_29, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_32, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3))). % 1.61/0.65 cnf(i_0_30, plain, (X1=sz00|aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2))). % 1.61/0.65 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aInteger0(X2)|~aInteger0(X3)|~aInteger0(X1))). % 1.61/0.65 cnf(i_0_140, plain, (X42=X42)). % 1.61/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.61/0.65 # Begin printing tableau % 1.61/0.65 # Found 11 steps % 1.61/0.65 cnf(i_0_40, hypothesis, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,xn)), inference(start_rule)). % 1.61/0.65 cnf(i_0_150, plain, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,xn)), inference(extension_rule, [i_0_149])). % 1.61/0.65 cnf(i_0_373, plain, (sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,xn)), inference(closure_rule, [i_0_40])). % 1.61/0.65 cnf(i_0_374, plain, (sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,xn)), inference(closure_rule, [i_0_40])). % 1.61/0.65 cnf(i_0_371, plain, (sdteqdtlpzmzozddtrp0(sdtasdt0(xq,xn),sdtasdt0(xq,xn),sdtasdt0(xq,xn))), inference(extension_rule, [i_0_30])). % 1.61/0.65 cnf(i_0_375, plain, (~sdteqdtlpzmzozddtrp0(sdtpldt0(xa,smndt0(xb)),sdtpldt0(xa,smndt0(xb)),sdtpldt0(xa,smndt0(xb)))), inference(etableau_closure_rule, [i_0_375, ...])). % 1.61/0.65 cnf(i_0_454, plain, (sdtasdt0(xq,xn)=sz00), inference(etableau_closure_rule, [i_0_454, ...])). % 1.61/0.65 cnf(i_0_455, plain, (aDivisorOf0(sdtasdt0(xq,xn),sdtpldt0(sdtasdt0(xq,xn),smndt0(sdtasdt0(xq,xn))))), inference(etableau_closure_rule, [i_0_455, ...])). % 1.61/0.65 cnf(i_0_457, plain, (~aInteger0(sdtasdt0(xq,xn))), inference(etableau_closure_rule, [i_0_457, ...])). % 1.61/0.65 cnf(i_0_458, plain, (~aInteger0(sdtasdt0(xq,xn))), inference(etableau_closure_rule, [i_0_458, ...])). % 1.61/0.65 cnf(i_0_459, plain, (~aInteger0(sdtasdt0(xq,xn))), inference(etableau_closure_rule, [i_0_459, ...])). % 1.61/0.65 # End printing tableau % 1.61/0.65 # SZS output end % 1.61/0.65 # Branches closed with saturation will be marked with an "s" % 1.61/0.65 # Child (2752) has found a proof. % 1.61/0.65 % 1.61/0.65 # Proof search is over... % 1.61/0.65 # Freeing feature tree %------------------------------------------------------------------------------