%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG047+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 : n024.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 20:27:11 EDT 2022 % Result : Theorem 0.20s 0.43s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : RNG047+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n024.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon May 30 21:06:51 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e % 0.20/0.37 # and selection function SelectLargestNegLit. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 51 Number of unprocessed: 51 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 51 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 7 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 44 extension rule candidate clauses % 0.20/0.38 # 7 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.43 # There were 7 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 7 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 7 successful branch saturations after the branch. % 0.20/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.20/0.43 cnf(i_0_11, plain, (aScalar0(sz0z00))). % 0.20/0.43 cnf(i_0_53, hypothesis, (aVector0(xs))). % 0.20/0.43 cnf(i_0_52, hypothesis, (aVector0(xt))). % 0.20/0.43 cnf(i_0_54, hypothesis, (aDimensionOf0(xt)!=sz00)). % 0.20/0.43 cnf(i_0_55, hypothesis, (aDimensionOf0(xs)=aDimensionOf0(xt))). % 0.20/0.43 cnf(i_0_15, plain, (smndt0(sz0z00)=sz0z00|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_3, plain, (szszuzczcdt0(X1)!=sz00|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_4, plain, (aNaturalNumber0(szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_45, plain, (aNaturalNumber0(aDimensionOf0(X1))|~aVector0(X1))). % 0.20/0.43 cnf(i_0_14, plain, (aScalar0(smndt0(X1))|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_16, plain, (smndt0(smndt0(X1))=X1|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_6, plain, (X1=sz00|aNaturalNumber0(esk1_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_20, plain, (sdtasdt0(X1,sz0z00)=sz0z00|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_19, plain, (sdtasdt0(sz0z00,X1)=sz0z00|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_5, plain, (X1=sz00|szszuzczcdt0(esk1_1(X1))=X1|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_22, plain, (sdtpldt0(X1,sz0z00)=X1|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_21, plain, (sdtpldt0(sz0z00,X1)=X1|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_34, plain, (sdtlseqdt0(X1,X1)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_56, negated_conjecture, (aDimensionOf0(sziznziztdt0(xs))!=aDimensionOf0(sziznziztdt0(xt)))). % 0.20/0.43 cnf(i_0_51, plain, (aDimensionOf0(X2)=sz00|aVector0(X1)|X1!=sziznziztdt0(X2)|~aVector0(X2))). % 0.20/0.43 cnf(i_0_18, plain, (sdtpldt0(X1,smndt0(X1))=sz0z00|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_17, plain, (sdtpldt0(smndt0(X1),X1)=sz0z00|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_9, plain, (iLess0(X1,szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_7, plain, (X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.43 cnf(i_0_50, plain, (aDimensionOf0(X2)=sz00|szszuzczcdt0(aDimensionOf0(X1))=aDimensionOf0(X2)|X1!=sziznziztdt0(X2)|~aVector0(X2))). % 0.20/0.43 cnf(i_0_39, plain, (sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_12, plain, (aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_13, plain, (aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_46, plain, (aScalar0(sdtlbdtrb0(X1,X2))|~aNaturalNumber0(X2)|~aVector0(X1))). % 0.20/0.43 cnf(i_0_42, plain, (sdtlseqdt0(sz0z00,sdtasdt0(X1,X1))|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_25, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_23, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_32, plain, (sdtasdt0(smndt0(X1),smndt0(X2))=sdtasdt0(X1,X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_49, plain, (aDimensionOf0(X3)=sz00|sdtlbdtrb0(X2,X1)=sdtlbdtrb0(X3,X1)|X2!=sziznziztdt0(X3)|~aNaturalNumber0(X1)|~aVector0(X3))). % 0.20/0.43 cnf(i_0_35, plain, (X1=X2|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2))). % 0.20/0.43 cnf(i_0_31, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(X1,smndt0(X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_30, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(smndt0(X1),X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_48, plain, (X2=sziznziztdt0(X1)|aDimensionOf0(X1)=sz00|aNaturalNumber0(esk2_2(X1,X2))|szszuzczcdt0(aDimensionOf0(X2))!=aDimensionOf0(X1)|~aVector0(X2)|~aVector0(X1))). % 0.20/0.43 cnf(i_0_36, plain, (sdtlseqdt0(X1,X3)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(X2,X3)|~sdtlseqdt0(X1,X2))). % 0.20/0.43 cnf(i_0_41, plain, (sdtlseqdt0(sz0z00,sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1))). % 0.20/0.43 cnf(i_0_40, plain, (sdtlseqdt0(sz0z00,sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1))). % 0.20/0.43 cnf(i_0_26, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_24, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_43, plain, (X1=X2|sdtasdt0(X1,X1)!=sdtasdt0(X2,X2)|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1))). % 0.20/0.43 cnf(i_0_28, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_27, plain, (sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))=sdtasdt0(sdtpldt0(X1,X2),X3)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 cnf(i_0_37, plain, (sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X4))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(X3,X4)|~sdtlseqdt0(X1,X2))). % 0.20/0.43 cnf(i_0_38, plain, (sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1)|~sdtlseqdt0(X3,X4)|~sdtlseqdt0(X1,X2)|~sdtlseqdt0(sz0z00,X3))). % 0.20/0.43 cnf(i_0_47, plain, (X1=sziznziztdt0(X2)|aDimensionOf0(X2)=sz00|szszuzczcdt0(aDimensionOf0(X1))!=aDimensionOf0(X2)|sdtlbdtrb0(X1,esk2_2(X2,X1))!=sdtlbdtrb0(X2,esk2_2(X2,X1))|~aVector0(X2)|~aVector0(X1))). % 0.20/0.43 cnf(i_0_29, plain, (sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))=sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 10 steps % 0.20/0.43 cnf(i_0_56, negated_conjecture, (aDimensionOf0(sziznziztdt0(xs))!=aDimensionOf0(sziznziztdt0(xt))), inference(start_rule)). % 0.20/0.43 cnf(i_0_57, plain, (aDimensionOf0(sziznziztdt0(xs))!=aDimensionOf0(sziznziztdt0(xt))), inference(extension_rule, [i_0_43])). % 0.20/0.43 cnf(i_0_177, plain, (sdtasdt0(aDimensionOf0(sziznziztdt0(xs)),aDimensionOf0(sziznziztdt0(xs)))!=sdtasdt0(aDimensionOf0(sziznziztdt0(xt)),aDimensionOf0(sziznziztdt0(xt)))), inference(extension_rule, [i_0_7])). % 0.20/0.43 cnf(i_0_178, plain, (~aScalar0(aDimensionOf0(sziznziztdt0(xt)))), inference(etableau_closure_rule, [i_0_178, ...])). % 0.20/0.43 cnf(i_0_179, plain, (~aScalar0(aDimensionOf0(sziznziztdt0(xs)))), inference(etableau_closure_rule, [i_0_179, ...])). % 0.20/0.43 cnf(i_0_180, plain, (~sdtlseqdt0(sz0z00,aDimensionOf0(sziznziztdt0(xt)))), inference(etableau_closure_rule, [i_0_180, ...])). % 0.20/0.43 cnf(i_0_181, plain, (~sdtlseqdt0(sz0z00,aDimensionOf0(sziznziztdt0(xs)))), inference(etableau_closure_rule, [i_0_181, ...])). % 0.20/0.43 cnf(i_0_255, plain, (szszuzczcdt0(sdtasdt0(aDimensionOf0(sziznziztdt0(xs)),aDimensionOf0(sziznziztdt0(xs))))!=szszuzczcdt0(sdtasdt0(aDimensionOf0(sziznziztdt0(xt)),aDimensionOf0(sziznziztdt0(xt))))), inference(etableau_closure_rule, [i_0_255, ...])). % 0.20/0.43 cnf(i_0_256, plain, (~aNaturalNumber0(sdtasdt0(aDimensionOf0(sziznziztdt0(xt)),aDimensionOf0(sziznziztdt0(xt))))), inference(etableau_closure_rule, [i_0_256, ...])). % 0.20/0.43 cnf(i_0_257, plain, (~aNaturalNumber0(sdtasdt0(aDimensionOf0(sziznziztdt0(xs)),aDimensionOf0(sziznziztdt0(xs))))), inference(etableau_closure_rule, [i_0_257, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.20/0.43 # We now have 3 tableaux to operate on % 0.20/0.43 # Found closed tableau during pool population. % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------