%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG049+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 : n022.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.46s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : RNG049+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 : n022.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 15:16:22 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 57 Number of unprocessed: 57 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.44 # The folding up rule is enabled... % 0.20/0.44 # Local unification is enabled... % 0.20/0.44 # Any saturation attempts will use folding labels... % 0.20/0.44 # 57 beginning clauses after preprocessing and clausification % 0.20/0.44 # Creating start rules for all 1 conjectures. % 0.20/0.44 # There are 1 start rule candidates: % 0.20/0.44 # Found 8 unit axioms. % 0.20/0.44 # 1 start rule tableaux created. % 0.20/0.44 # 49 extension rule candidate clauses % 0.20/0.44 # 8 unit axiom clauses % 0.20/0.44 % 0.20/0.44 # Requested 8, 32 cores available to the main process. % 0.20/0.44 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.46 # There were 3 total branch saturation attempts. % 0.20/0.46 # There were 0 of these attempts blocked. % 0.20/0.46 # There were 0 deferred branch saturation attempts. % 0.20/0.46 # There were 0 free duplicated saturations. % 0.20/0.46 # There were 3 total successful branch saturations. % 0.20/0.46 # There were 1 successful branch saturations in interreduction. % 0.20/0.46 # There were 0 successful branch saturations on the branch. % 0.20/0.46 # There were 2 successful branch saturations after the branch. % 0.20/0.46 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.46 # Begin clausification derivation % 0.20/0.46 % 0.20/0.46 # End clausification derivation % 0.20/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.46 cnf(i_0_11, plain, (aScalar0(sz0z00))). % 0.20/0.46 cnf(i_0_56, hypothesis, (aVector0(xs))). % 0.20/0.46 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.20/0.46 cnf(i_0_61, hypothesis, (sdtlseqdt0(sz0z00,sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs))))). % 0.20/0.46 cnf(i_0_60, hypothesis, (sdtlseqdt0(sz0z00,sdtasdt0(sdtlbdtrb0(xs,aDimensionOf0(xs)),sdtlbdtrb0(xs,aDimensionOf0(xs)))))). % 0.20/0.46 cnf(i_0_59, hypothesis, (sdtpldt0(sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs)),sdtasdt0(sdtlbdtrb0(xs,aDimensionOf0(xs)),sdtlbdtrb0(xs,aDimensionOf0(xs))))=sdtasasdt0(xs,xs))). % 0.20/0.46 cnf(i_0_62, negated_conjecture, (~sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))). % 0.20/0.46 cnf(i_0_58, hypothesis, (aDimensionOf0(xs)!=sz00)). % 0.20/0.46 cnf(i_0_15, plain, (smndt0(sz0z00)=sz0z00|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_20, plain, (sdtasdt0(X1,sz0z00)=sz0z00|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_3, plain, (szszuzczcdt0(X1)!=sz00|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_34, plain, (sdtlseqdt0(X1,X1)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_4, plain, (aNaturalNumber0(szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_45, plain, (aNaturalNumber0(aDimensionOf0(X1))|~aVector0(X1))). % 0.20/0.46 cnf(i_0_19, plain, (sdtasdt0(sz0z00,X1)=sz0z00|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_22, plain, (sdtpldt0(X1,sz0z00)=X1|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_21, plain, (sdtpldt0(sz0z00,X1)=X1|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_14, plain, (aScalar0(smndt0(X1))|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_16, plain, (smndt0(smndt0(X1))=X1|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_18, plain, (sdtpldt0(X1,smndt0(X1))=sz0z00|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_9, plain, (iLess0(X1,szszuzczcdt0(X1))|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_7, plain, (X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_12, plain, (aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_13, plain, (aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_17, plain, (sdtpldt0(smndt0(X1),X1)=sz0z00|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_42, plain, (sdtlseqdt0(sz0z00,sdtasdt0(X1,X1))|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_6, plain, (X1=sz00|aNaturalNumber0(esk1_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_46, plain, (aScalar0(sdtlbdtrb0(X1,X2))|~aVector0(X1)|~aNaturalNumber0(X2))). % 0.20/0.46 cnf(i_0_5, plain, (szszuzczcdt0(esk1_1(X1))=X1|X1=sz00|~aNaturalNumber0(X1))). % 0.20/0.46 cnf(i_0_35, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_51, plain, (aDimensionOf0(X1)=sz00|aVector0(sziznziztdt0(X1))|~aVector0(X1))). % 0.20/0.46 cnf(i_0_53, plain, (aScalar0(sdtasasdt0(X1,X2))|aDimensionOf0(X1)!=aDimensionOf0(X2)|~aVector0(X2)|~aVector0(X1))). % 0.20/0.46 cnf(i_0_39, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_31, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(X1,smndt0(X2))|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_57, hypothesis, (sdtlseqdt0(sz0z00,sdtasasdt0(X1,X1))|~aVector0(X1)|~iLess0(aDimensionOf0(X1),aDimensionOf0(xs)))). % 0.20/0.46 cnf(i_0_41, plain, (sdtlseqdt0(sz0z00,sdtpldt0(X1,X2))|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_40, plain, (sdtlseqdt0(sz0z00,sdtasdt0(X1,X2))|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_54, plain, (sdtasasdt0(X1,X2)=sz0z00|aDimensionOf0(X1)!=aDimensionOf0(X2)|aDimensionOf0(X2)!=sz00|~aVector0(X2)|~aVector0(X1))). % 0.20/0.46 cnf(i_0_50, plain, (szszuzczcdt0(aDimensionOf0(sziznziztdt0(X1)))=aDimensionOf0(X1)|aDimensionOf0(X1)=sz00|~aVector0(X1))). % 0.20/0.46 cnf(i_0_36, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aScalar0(X2)|~aScalar0(X3)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_30, plain, (smndt0(sdtasdt0(X1,X2))=sdtasdt0(smndt0(X1),X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_25, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_23, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_32, plain, (sdtasdt0(smndt0(X1),smndt0(X2))=sdtasdt0(X1,X2)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_43, plain, (X1=X2|sdtasdt0(X1,X1)!=sdtasdt0(X2,X2)|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(sz0z00,X1)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_26, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_24, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_52, plain, (aDimensionOf0(sziznziztdt0(X1))=aDimensionOf0(sziznziztdt0(X2))|aDimensionOf0(X2)=sz00|aDimensionOf0(X1)!=aDimensionOf0(X2)|~aVector0(X2)|~aVector0(X1))). % 0.20/0.46 cnf(i_0_49, plain, (sdtlbdtrb0(sziznziztdt0(X1),X2)=sdtlbdtrb0(X1,X2)|aDimensionOf0(X1)=sz00|~aVector0(X1)|~aNaturalNumber0(X2))). % 0.20/0.46 cnf(i_0_37, plain, (sdtlseqdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))|~sdtlseqdt0(X2,X4)|~sdtlseqdt0(X1,X3)|~aScalar0(X4)|~aScalar0(X2)|~aScalar0(X3)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_48, plain, (aDimensionOf0(X1)=sz00|X2=sziznziztdt0(X1)|aNaturalNumber0(esk2_2(X1,X2))|szszuzczcdt0(aDimensionOf0(X2))!=aDimensionOf0(X1)|~aVector0(X2)|~aVector0(X1))). % 0.20/0.46 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.46 cnf(i_0_27, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aScalar0(X2)|~aScalar0(X3)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_38, plain, (sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X3,X4))|~sdtlseqdt0(sz0z00,X2)|~sdtlseqdt0(X2,X4)|~sdtlseqdt0(X1,X3)|~aScalar0(X4)|~aScalar0(X2)|~aScalar0(X3)|~aScalar0(X1))). % 0.20/0.46 cnf(i_0_47, plain, (aDimensionOf0(X1)=sz00|X2=sziznziztdt0(X1)|sdtlbdtrb0(X2,esk2_2(X1,X2))!=sdtlbdtrb0(X1,esk2_2(X1,X2))|szszuzczcdt0(aDimensionOf0(X2))!=aDimensionOf0(X1)|~aVector0(X1)|~aVector0(X2))). % 0.20/0.46 cnf(i_0_55, plain, (sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2))))=sdtasasdt0(X1,X2)|aDimensionOf0(X2)=sz00|aDimensionOf0(X1)!=aDimensionOf0(X2)|~aVector0(X2)|~aVector0(X1))). % 0.20/0.46 cnf(i_0_29, plain, (sdtpldt0(sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)),sdtpldt0(sdtasdt0(X4,X2),sdtasdt0(X4,X3)))=sdtasdt0(sdtpldt0(X1,X4),sdtpldt0(X2,X3))|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X4)|~aScalar0(X1))). % 0.20/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.46 # Begin printing tableau % 0.20/0.46 # Found 10 steps % 0.20/0.46 cnf(i_0_62, negated_conjecture, (~sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))), inference(start_rule)). % 0.20/0.46 cnf(i_0_66, plain, (~sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))), inference(extension_rule, [i_0_36])). % 0.20/0.46 cnf(i_0_158, plain, (~sdtlseqdt0(sz0z00,sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs)))), inference(closure_rule, [i_0_61])). % 0.20/0.46 cnf(i_0_161, plain, (~aScalar0(sz0z00)), inference(closure_rule, [i_0_11])). % 0.20/0.46 cnf(i_0_159, plain, (~aScalar0(sdtasasdt0(xs,xs))), inference(extension_rule, [i_0_53])). % 0.20/0.46 cnf(i_0_480, plain, (~aVector0(xs)), inference(closure_rule, [i_0_56])). % 0.20/0.46 cnf(i_0_481, plain, (~aVector0(xs)), inference(closure_rule, [i_0_56])). % 0.20/0.46 cnf(i_0_157, plain, (~sdtlseqdt0(sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs)),sdtasasdt0(xs,xs))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.20/0.46 cnf(i_0_160, plain, (~aScalar0(sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs)))), inference(etableau_closure_rule, [i_0_160, ...])). % 0.20/0.46 cnf(i_0_479, plain, ($false), inference(etableau_closure_rule, [i_0_479, ...])). % 0.20/0.46 # End printing tableau % 0.20/0.46 # SZS output end % 0.20/0.46 # Branches closed with saturation will be marked with an "s" % 0.20/0.46 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.20/0.46 # We now have 4 tableaux to operate on % 0.20/0.46 # Found closed tableau during pool population. % 0.20/0.46 # Proof search is over... % 0.20/0.46 # Freeing feature tree %------------------------------------------------------------------------------